Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r267-smll-167863542000565.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Peterson-COL-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542000565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:23 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-3-UpperBounds-00
FORMULA_NAME Peterson-COL-3-UpperBounds-01
FORMULA_NAME Peterson-COL-3-UpperBounds-02
FORMULA_NAME Peterson-COL-3-UpperBounds-03
FORMULA_NAME Peterson-COL-3-UpperBounds-04
FORMULA_NAME Peterson-COL-3-UpperBounds-05
FORMULA_NAME Peterson-COL-3-UpperBounds-06
FORMULA_NAME Peterson-COL-3-UpperBounds-07
FORMULA_NAME Peterson-COL-3-UpperBounds-08
FORMULA_NAME Peterson-COL-3-UpperBounds-09
FORMULA_NAME Peterson-COL-3-UpperBounds-10
FORMULA_NAME Peterson-COL-3-UpperBounds-11
FORMULA_NAME Peterson-COL-3-UpperBounds-12
FORMULA_NAME Peterson-COL-3-UpperBounds-13
FORMULA_NAME Peterson-COL-3-UpperBounds-14
FORMULA_NAME Peterson-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678929223567

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 01:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 01:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:13:46] [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.
[2023-03-16 01:13:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 01:13:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1123 ms
[2023-03-16 01:13:47] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2023-03-16 01:13:47] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2023-03-16 01:13:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-16 01:13:47] [INFO ] Computed 1 place invariants in 5 ms
FORMULA Peterson-COL-3-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 01:13:47] [INFO ] Invariant cache hit.
[2023-03-16 01:13:47] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-16 01:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-16 01:13:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:13:48] [INFO ] Added : 12 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 01:13:48] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 01:13:48] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:13:49] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:13:49] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 01:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 01:13:49] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:13:49] [INFO ] Added : 12 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 01:13:49] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 01:13:49] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-16 01:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 01:13:49] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 01:13:49] [INFO ] Added : 12 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] 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.
[2023-03-16 01:13:49] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 43 ms.
[2023-03-16 01:13:49] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :33
FORMULA Peterson-COL-3-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :8
[2023-03-16 01:13:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-16 01:13:49] [INFO ] Computed 15 place invariants in 17 ms
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-16 01:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:50] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-16 01:13:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-16 01:13:50] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-16 01:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:50] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-16 01:13:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 01:13:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2023-03-16 01:13:50] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 22 ms to minimize.
[2023-03-16 01:13:50] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2023-03-16 01:13:50] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:13:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 0 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2023-03-16 01:13:52] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 1 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2023-03-16 01:13:53] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 0 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 1 ms to minimize.
[2023-03-16 01:13:54] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2023-03-16 01:13:55] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-16 01:13:55] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 4693 ms
[2023-03-16 01:13:55] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 01:13:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:55] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-16 01:13:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-16 01:13:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-16 01:13:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:55] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-16 01:13:55] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2023-03-16 01:13:55] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2023-03-16 01:13:55] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-03-16 01:13:56] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-16 01:13:56] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-16 01:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 401 ms
[2023-03-16 01:13:56] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-16 01:13:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:13:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:56] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-16 01:13:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-16 01:13:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:56] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-16 01:13:56] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2023-03-16 01:13:56] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 1 ms to minimize.
[2023-03-16 01:13:56] [INFO ] Deduced a trap composed of 120 places in 195 ms of which 1 ms to minimize.
[2023-03-16 01:13:57] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 0 ms to minimize.
[2023-03-16 01:13:57] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2023-03-16 01:13:57] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 1 ms to minimize.
[2023-03-16 01:13:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 924 ms
[2023-03-16 01:13:57] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 37 ms.
[2023-03-16 01:13:58] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2023-03-16 01:13:58] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 1 ms to minimize.
[2023-03-16 01:13:58] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 1 ms to minimize.
[2023-03-16 01:13:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 584 ms
[2023-03-16 01:13:58] [INFO ] Added : 79 causal constraints over 16 iterations in 1126 ms. Result :sat
Minimization took 122 ms.
[2023-03-16 01:13:58] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-16 01:13:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-16 01:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:58] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-16 01:13:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:13:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 01:13:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-16 01:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:13:59] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-16 01:13:59] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2023-03-16 01:13:59] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 1 ms to minimize.
[2023-03-16 01:13:59] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 1 ms to minimize.
[2023-03-16 01:13:59] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-16 01:14:00] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 1 ms to minimize.
[2023-03-16 01:14:00] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2023-03-16 01:14:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1009 ms
[2023-03-16 01:14:00] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 31 ms.
[2023-03-16 01:14:00] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2023-03-16 01:14:01] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 3 ms to minimize.
[2023-03-16 01:14:01] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2023-03-16 01:14:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 605 ms
[2023-03-16 01:14:01] [INFO ] Added : 79 causal constraints over 16 iterations in 1148 ms. Result :sat
Minimization took 126 ms.
[2023-03-16 01:14:01] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-16 01:14:01] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-16 01:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:01] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-16 01:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-16 01:14:01] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-16 01:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:01] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-16 01:14:01] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2023-03-16 01:14:02] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2023-03-16 01:14:03] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 3 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 0 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 1 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2023-03-16 01:14:04] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2023-03-16 01:14:05] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2023-03-16 01:14:06] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:14:06] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 01:14:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:06] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-16 01:14:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:14:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-16 01:14:07] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-16 01:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:07] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-16 01:14:07] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2023-03-16 01:14:07] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-16 01:14:07] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-16 01:14:07] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-16 01:14:07] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 0 ms to minimize.
[2023-03-16 01:14:07] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2023-03-16 01:14:08] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 0 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 1 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-16 01:14:09] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 0 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 1 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 0 ms to minimize.
[2023-03-16 01:14:10] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 0 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 0 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-16 01:14:11] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-03-16 01:14:12] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2023-03-16 01:14: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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4, 3, 4, 4, 4, 4] Max seen :[1, 3, 2, 2, 1, 1]
FORMULA Peterson-COL-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 192 place count 148 transition count 192
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 82 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 92/244 places, 180/332 transitions.
Normalized transition count is 156 out of 180 initially.
// Phase 1: matrix 156 rows 92 cols
[2023-03-16 01:14:12] [INFO ] Computed 15 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1606 ms. (steps per millisecond=622 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 3) seen :3
[2023-03-16 01:14:15] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2023-03-16 01:14:15] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-16 01:14:15] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 01:14:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-16 01:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:15] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-16 01:14:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:14:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-16 01:14:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-16 01:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:16] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-16 01:14:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 01:14:16] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-16 01:14:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-16 01:14:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-16 01:14:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-16 01:14:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2023-03-16 01:14:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2023-03-16 01:14:19] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-16 01:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 3760 ms
[2023-03-16 01:14:19] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-16 01:14:19] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-16 01:14:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:14:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-16 01:14:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:19] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-16 01:14:20] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-16 01:14:20] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:21] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-16 01:14:22] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:23] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-16 01:14:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2023-03-16 01:14:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-16 01:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 3637 ms
[2023-03-16 01:14:23] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-16 01:14:23] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-16 01:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:23] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-16 01:14:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:14:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-16 01:14:23] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-16 01:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:14:23] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-16 01:14:23] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2023-03-16 01:14:23] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-16 01:14:24] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 3 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-16 01:14:26] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-03-16 01:14:27] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-03-16 01:14:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-16 01:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 3585 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[1, 1, 1]
FORMULA Peterson-COL-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41209 ms.
ITS solved all properties within timeout

BK_STOP 1678929268585

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Peterson-COL-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863542000565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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