About the Execution of Marcie+red for Peterson-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5883.752 | 3600000.00 | 3656550.00 | 9485.80 | ? 7 7 7 8 7 8 8 8 ? 8 7 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/mcc2023-input.r266-smll-167863541200597.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 marciexred
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 r266-smll-167863541200597
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.1K Feb 25 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.4K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 47K 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-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 1679181333794
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-7
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:15:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 23:15:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:15:36] [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-18 23:15:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 23:15:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 775 ms
[2023-03-18 23:15:37] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 2048 PT places and 3384.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-18 23:15:37] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 14 ms.
[2023-03-18 23:15:37] [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-18 23:15:37] [INFO ] Computed 1 place invariants in 5 ms
FORMULA Peterson-COL-7-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-7-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 23:15:37] [INFO ] Invariant cache hit.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-18 23:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-18 23:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 23:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:37] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-18 23:15:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 23:15:37] [INFO ] Added : 12 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 10 ms.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-18 23:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:37] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-18 23:15:37] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 23:15:37] [INFO ] Added : 11 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 9 ms.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 7 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 23:15:38] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 23:15:38] [INFO ] Added : 11 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 23:15:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 23:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-18 23:15:38] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 23:15:39] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 23:15:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-18 23:15:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 23:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 23:15:39] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 23:15:39] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 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.
[2023-03-18 23:15:39] [INFO ] Unfolded HLPN to a Petri net with 2048 places and 3208 transitions 10032 arcs in 101 ms.
[2023-03-18 23:15:39] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 56 places in 26 ms
Reduce places removed 56 places and 112 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 13) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :26
FORMULA Peterson-COL-7-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :21
FORMULA Peterson-COL-7-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :38
FORMULA Peterson-COL-7-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-7-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :9
FORMULA Peterson-COL-7-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :19
FORMULA Peterson-COL-7-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-18 23:15:40] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 23:15:40] [INFO ] Computed 31 place invariants in 52 ms
[2023-03-18 23:15:41] [INFO ] [Real]Absence check using 23 positive place invariants in 82 ms returned sat
[2023-03-18 23:15:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 31 ms returned sat
[2023-03-18 23:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:42] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2023-03-18 23:15:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 78 ms returned sat
[2023-03-18 23:15:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-18 23:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:44] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2023-03-18 23:15:44] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:15:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 391 ms returned sat
[2023-03-18 23:15:47] [INFO ] Deduced a trap composed of 13 places in 2431 ms of which 10 ms to minimize.
[2023-03-18 23:15:49] [INFO ] Deduced a trap composed of 17 places in 1892 ms of which 6 ms to minimize.
[2023-03-18 23:15:49] [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: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-18 23:15:50] [INFO ] [Real]Absence check using 23 positive place invariants in 83 ms returned sat
[2023-03-18 23:15:50] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2023-03-18 23:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:51] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2023-03-18 23:15:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 78 ms returned sat
[2023-03-18 23:15:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 32 ms returned sat
[2023-03-18 23:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:53] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2023-03-18 23:15:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 331 ms returned sat
[2023-03-18 23:15:55] [INFO ] Deduced a trap composed of 32 places in 1760 ms of which 3 ms to minimize.
[2023-03-18 23:15:57] [INFO ] Deduced a trap composed of 33 places in 1598 ms of which 4 ms to minimize.
[2023-03-18 23:15:57] [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: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-18 23:15:58] [INFO ] [Real]Absence check using 23 positive place invariants in 76 ms returned sat
[2023-03-18 23:15:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 30 ms returned sat
[2023-03-18 23:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:15:59] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2023-03-18 23:15:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:15:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 78 ms returned sat
[2023-03-18 23:16:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2023-03-18 23:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:01] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2023-03-18 23:16:01] [INFO ] [Nat]Added 497 Read/Feed constraints in 321 ms returned sat
[2023-03-18 23:16:03] [INFO ] Deduced a trap composed of 32 places in 1716 ms of which 2 ms to minimize.
[2023-03-18 23:16:05] [INFO ] Deduced a trap composed of 33 places in 1809 ms of which 2 ms to minimize.
[2023-03-18 23:16:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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-18 23:16:05] [INFO ] [Real]Absence check using 23 positive place invariants in 75 ms returned sat
[2023-03-18 23:16:06] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 31 ms returned sat
[2023-03-18 23:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:07] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2023-03-18 23:16:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:16:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 64 ms returned sat
[2023-03-18 23:16:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2023-03-18 23:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:09] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2023-03-18 23:16:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 535 ms returned sat
[2023-03-18 23:16:11] [INFO ] Deduced a trap composed of 42 places in 1864 ms of which 2 ms to minimize.
[2023-03-18 23:16:13] [INFO ] Deduced a trap composed of 96 places in 1582 ms of which 2 ms to minimize.
[2023-03-18 23:16:13] [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 3
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-18 23:16:13] [INFO ] [Real]Absence check using 23 positive place invariants in 51 ms returned sat
[2023-03-18 23:16:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2023-03-18 23:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:15] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2023-03-18 23:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:16:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 79 ms returned sat
[2023-03-18 23:16:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2023-03-18 23:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:17] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2023-03-18 23:16:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 330 ms returned sat
[2023-03-18 23:16:19] [INFO ] Deduced a trap composed of 32 places in 1818 ms of which 2 ms to minimize.
[2023-03-18 23:16:21] [INFO ] Deduced a trap composed of 33 places in 1612 ms of which 2 ms to minimize.
[2023-03-18 23:16:21] [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-18 23:16:21] [INFO ] [Real]Absence check using 23 positive place invariants in 57 ms returned sat
[2023-03-18 23:16:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 23 ms returned sat
[2023-03-18 23:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:23] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2023-03-18 23:16:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:16:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 52 ms returned sat
[2023-03-18 23:16:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 20 ms returned sat
[2023-03-18 23:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:16:25] [INFO ] [Nat]Absence check using state equation in 1284 ms returned sat
[2023-03-18 23:16:25] [INFO ] [Nat]Added 497 Read/Feed constraints in 373 ms returned sat
[2023-03-18 23:16:28] [INFO ] Deduced a trap composed of 42 places in 2381 ms of which 3 ms to minimize.
[2023-03-18 23:16:30] [INFO ] Deduced a trap composed of 96 places in 1900 ms of which 2 ms to minimize.
[2023-03-18 23:16:30] [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) : [8, 8, 8, 8, 8, 8] Max seen :[1, 7, 7, 4, 7, 4]
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2256
Deduced a syphon composed of 56 places in 11 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1680 place count 1152 transition count 2256
Applied a total of 1680 rules in 688 ms. Remains 1152 /1992 variables (removed 840) and now considering 2256/3096 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 1152/1992 places, 2256/3096 transitions.
Normalized transition count is 1920 out of 2256 initially.
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-18 23:16:31] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20143 ms. (steps per millisecond=49 ) properties (out of 6) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2835 ms. (steps per millisecond=352 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3512 ms. (steps per millisecond=284 ) properties (out of 6) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3146 ms. (steps per millisecond=317 ) properties (out of 6) seen :23
Interrupted Best-First random walk after 627319 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3620 ms. (steps per millisecond=276 ) properties (out of 6) seen :23
Finished Best-First random walk after 597385 steps, including 1 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=119 )
[2023-03-18 23:17:14] [INFO ] Flow matrix only has 1920 transitions (discarded 336 similar events)
// Phase 1: matrix 1920 rows 1152 cols
[2023-03-18 23:17:14] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-18 23:17:14] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2023-03-18 23:17:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-18 23:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:17:15] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2023-03-18 23:17:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:17:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-18 23:17:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 23:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:17:16] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2023-03-18 23:17:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:17:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 273 ms returned sat
[2023-03-18 23:17:17] [INFO ] Deduced a trap composed of 32 places in 838 ms of which 1 ms to minimize.
[2023-03-18 23:17:18] [INFO ] Deduced a trap composed of 28 places in 897 ms of which 2 ms to minimize.
[2023-03-18 23:17:19] [INFO ] Deduced a trap composed of 49 places in 874 ms of which 2 ms to minimize.
[2023-03-18 23:17:20] [INFO ] Deduced a trap composed of 15 places in 892 ms of which 1 ms to minimize.
[2023-03-18 23:17:21] [INFO ] Deduced a trap composed of 13 places in 756 ms of which 1 ms to minimize.
[2023-03-18 23:17:22] [INFO ] Deduced a trap composed of 105 places in 1049 ms of which 1 ms to minimize.
[2023-03-18 23:17:23] [INFO ] Deduced a trap composed of 57 places in 933 ms of which 4 ms to minimize.
[2023-03-18 23:17:24] [INFO ] Deduced a trap composed of 13 places in 849 ms of which 1 ms to minimize.
[2023-03-18 23:17:26] [INFO ] Deduced a trap composed of 57 places in 915 ms of which 1 ms to minimize.
[2023-03-18 23:17:27] [INFO ] Deduced a trap composed of 58 places in 874 ms of which 2 ms to minimize.
[2023-03-18 23:17:28] [INFO ] Deduced a trap composed of 13 places in 927 ms of which 1 ms to minimize.
[2023-03-18 23:17:28] [INFO ] Deduced a trap composed of 75 places in 824 ms of which 2 ms to minimize.
[2023-03-18 23:17:29] [INFO ] Deduced a trap composed of 72 places in 753 ms of which 1 ms to minimize.
[2023-03-18 23:17:30] [INFO ] Deduced a trap composed of 53 places in 722 ms of which 2 ms to minimize.
[2023-03-18 23:17:31] [INFO ] Deduced a trap composed of 45 places in 734 ms of which 1 ms to minimize.
[2023-03-18 23:17:32] [INFO ] Deduced a trap composed of 34 places in 863 ms of which 2 ms to minimize.
[2023-03-18 23:17:34] [INFO ] Deduced a trap composed of 52 places in 1051 ms of which 2 ms to minimize.
[2023-03-18 23:17:35] [INFO ] Deduced a trap composed of 25 places in 864 ms of which 1 ms to minimize.
[2023-03-18 23:17:36] [INFO ] Deduced a trap composed of 69 places in 1157 ms of which 4 ms to minimize.
[2023-03-18 23:17:37] [INFO ] Deduced a trap composed of 76 places in 1090 ms of which 2 ms to minimize.
[2023-03-18 23:17:38] [INFO ] Deduced a trap composed of 34 places in 1122 ms of which 1 ms to minimize.
[2023-03-18 23:17:39] [INFO ] Deduced a trap composed of 82 places in 897 ms of which 2 ms to minimize.
[2023-03-18 23:17:40] [INFO ] Deduced a trap composed of 28 places in 943 ms of which 1 ms to minimize.
[2023-03-18 23:17:42] [INFO ] Deduced a trap composed of 76 places in 977 ms of which 2 ms to minimize.
[2023-03-18 23:17:43] [INFO ] Deduced a trap composed of 15 places in 999 ms of which 1 ms to minimize.
[2023-03-18 23:17:44] [INFO ] Deduced a trap composed of 15 places in 1080 ms of which 1 ms to minimize.
[2023-03-18 23:17:45] [INFO ] Deduced a trap composed of 86 places in 907 ms of which 1 ms to minimize.
[2023-03-18 23:17:46] [INFO ] Deduced a trap composed of 63 places in 863 ms of which 2 ms to minimize.
[2023-03-18 23:17:47] [INFO ] Deduced a trap composed of 93 places in 986 ms of which 1 ms to minimize.
[2023-03-18 23:17:48] [INFO ] Deduced a trap composed of 51 places in 792 ms of which 1 ms to minimize.
[2023-03-18 23:17:49] [INFO ] Deduced a trap composed of 44 places in 863 ms of which 1 ms to minimize.
[2023-03-18 23:17:50] [INFO ] Deduced a trap composed of 51 places in 848 ms of which 2 ms to minimize.
[2023-03-18 23:17:51] [INFO ] Deduced a trap composed of 43 places in 1055 ms of which 1 ms to minimize.
[2023-03-18 23:17:52] [INFO ] Deduced a trap composed of 32 places in 964 ms of which 1 ms to minimize.
[2023-03-18 23:17:53] [INFO ] Deduced a trap composed of 45 places in 835 ms of which 2 ms to minimize.
[2023-03-18 23:17:54] [INFO ] Deduced a trap composed of 86 places in 996 ms of which 6 ms to minimize.
[2023-03-18 23:17:55] [INFO ] Deduced a trap composed of 79 places in 870 ms of which 2 ms to minimize.
[2023-03-18 23:17:56] [INFO ] Deduced a trap composed of 44 places in 1050 ms of which 2 ms to minimize.
[2023-03-18 23:17:57] [INFO ] Deduced a trap composed of 53 places in 1043 ms of which 2 ms to minimize.
[2023-03-18 23:17:58] [INFO ] Deduced a trap composed of 34 places in 783 ms of which 1 ms to minimize.
[2023-03-18 23:18:00] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 43690 ms
[2023-03-18 23:18:00] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 23:18:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 23:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:01] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2023-03-18 23:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:18:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2023-03-18 23:18:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-18 23:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:02] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2023-03-18 23:18:03] [INFO ] [Nat]Added 497 Read/Feed constraints in 176 ms returned sat
[2023-03-18 23:18:03] [INFO ] Deduced a trap composed of 25 places in 784 ms of which 1 ms to minimize.
[2023-03-18 23:18:05] [INFO ] Deduced a trap composed of 21 places in 1020 ms of which 1 ms to minimize.
[2023-03-18 23:18:05] [INFO ] Deduced a trap composed of 25 places in 772 ms of which 1 ms to minimize.
[2023-03-18 23:18:06] [INFO ] Deduced a trap composed of 25 places in 723 ms of which 1 ms to minimize.
[2023-03-18 23:18:07] [INFO ] Deduced a trap composed of 25 places in 792 ms of which 2 ms to minimize.
[2023-03-18 23:18:08] [INFO ] Deduced a trap composed of 25 places in 844 ms of which 2 ms to minimize.
[2023-03-18 23:18:09] [INFO ] Deduced a trap composed of 22 places in 990 ms of which 1 ms to minimize.
[2023-03-18 23:18:10] [INFO ] Deduced a trap composed of 21 places in 1048 ms of which 1 ms to minimize.
[2023-03-18 23:18:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7680 ms
[2023-03-18 23:18:11] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2023-03-18 23:18:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-18 23:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:11] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2023-03-18 23:18:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:18:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-18 23:18:12] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-18 23:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:12] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2023-03-18 23:18:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 182 ms returned sat
[2023-03-18 23:18:14] [INFO ] Deduced a trap composed of 25 places in 942 ms of which 1 ms to minimize.
[2023-03-18 23:18:15] [INFO ] Deduced a trap composed of 21 places in 947 ms of which 2 ms to minimize.
[2023-03-18 23:18:16] [INFO ] Deduced a trap composed of 25 places in 960 ms of which 1 ms to minimize.
[2023-03-18 23:18:17] [INFO ] Deduced a trap composed of 25 places in 894 ms of which 5 ms to minimize.
[2023-03-18 23:18:18] [INFO ] Deduced a trap composed of 25 places in 884 ms of which 4 ms to minimize.
[2023-03-18 23:18:19] [INFO ] Deduced a trap composed of 25 places in 893 ms of which 1 ms to minimize.
[2023-03-18 23:18:20] [INFO ] Deduced a trap composed of 22 places in 953 ms of which 1 ms to minimize.
[2023-03-18 23:18:21] [INFO ] Deduced a trap composed of 21 places in 964 ms of which 11 ms to minimize.
[2023-03-18 23:18:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 8040 ms
[2023-03-18 23:18:21] [INFO ] [Real]Absence check using 23 positive place invariants in 46 ms returned sat
[2023-03-18 23:18:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-18 23:18:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:22] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-18 23:18:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:18:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-18 23:18:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2023-03-18 23:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:18:23] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2023-03-18 23:18:23] [INFO ] [Nat]Added 497 Read/Feed constraints in 285 ms returned sat
[2023-03-18 23:18:25] [INFO ] Deduced a trap composed of 146 places in 1083 ms of which 1 ms to minimize.
[2023-03-18 23:18:26] [INFO ] Deduced a trap composed of 61 places in 1038 ms of which 2 ms to minimize.
[2023-03-18 23:18:27] [INFO ] Deduced a trap composed of 43 places in 1031 ms of which 1 ms to minimize.
[2023-03-18 23:18:28] [INFO ] Deduced a trap composed of 66 places in 996 ms of which 1 ms to minimize.
[2023-03-18 23:18:29] [INFO ] Deduced a trap composed of 47 places in 940 ms of which 1 ms to minimize.
[2023-03-18 23:18:30] [INFO ] Deduced a trap composed of 104 places in 1079 ms of which 1 ms to minimize.
[2023-03-18 23:18:31] [INFO ] Deduced a trap composed of 89 places in 1046 ms of which 1 ms to minimize.
[2023-03-18 23:18:32] [INFO ] Deduced a trap composed of 117 places in 1020 ms of which 1 ms to minimize.
[2023-03-18 23:18:33] [INFO ] Deduced a trap composed of 65 places in 1028 ms of which 1 ms to minimize.
[2023-03-18 23:18:34] [INFO ] Deduced a trap composed of 241 places in 902 ms of which 2 ms to minimize.
[2023-03-18 23:18:35] [INFO ] Deduced a trap composed of 138 places in 939 ms of which 1 ms to minimize.
[2023-03-18 23:18:36] [INFO ] Deduced a trap composed of 148 places in 924 ms of which 3 ms to minimize.
[2023-03-18 23:18:38] [INFO ] Deduced a trap composed of 138 places in 1118 ms of which 1 ms to minimize.
[2023-03-18 23:18:39] [INFO ] Deduced a trap composed of 164 places in 1080 ms of which 1 ms to minimize.
[2023-03-18 23:18:40] [INFO ] Deduced a trap composed of 58 places in 1079 ms of which 2 ms to minimize.
[2023-03-18 23:18:41] [INFO ] Deduced a trap composed of 74 places in 1065 ms of which 1 ms to minimize.
[2023-03-18 23:18:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 17926 ms
[2023-03-18 23:18:42] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 219 ms.
[2023-03-18 23:19:01] [INFO ] Deduced a trap composed of 94 places in 1247 ms of which 2 ms to minimize.
[2023-03-18 23:19:02] [INFO ] Deduced a trap composed of 20 places in 1459 ms of which 2 ms to minimize.
[2023-03-18 23:19:04] [INFO ] Deduced a trap composed of 34 places in 1034 ms of which 1 ms to minimize.
[2023-03-18 23:19:05] [INFO ] Deduced a trap composed of 33 places in 1079 ms of which 1 ms to minimize.
[2023-03-18 23:19:06] [INFO ] Deduced a trap composed of 43 places in 1093 ms of which 2 ms to minimize.
[2023-03-18 23:19:08] [INFO ] Deduced a trap composed of 11 places in 1246 ms of which 2 ms to minimize.
[2023-03-18 23:19:08] [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 3
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-18 23:19:08] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2023-03-18 23:19:08] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-18 23:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:19:09] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2023-03-18 23:19:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:19:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2023-03-18 23:19:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-18 23:19:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:19:10] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2023-03-18 23:19:10] [INFO ] [Nat]Added 497 Read/Feed constraints in 281 ms returned sat
[2023-03-18 23:19:11] [INFO ] Deduced a trap composed of 25 places in 775 ms of which 1 ms to minimize.
[2023-03-18 23:19:12] [INFO ] Deduced a trap composed of 21 places in 684 ms of which 2 ms to minimize.
[2023-03-18 23:19:13] [INFO ] Deduced a trap composed of 25 places in 1022 ms of which 1 ms to minimize.
[2023-03-18 23:19:14] [INFO ] Deduced a trap composed of 25 places in 788 ms of which 2 ms to minimize.
[2023-03-18 23:19:15] [INFO ] Deduced a trap composed of 25 places in 755 ms of which 1 ms to minimize.
[2023-03-18 23:19:16] [INFO ] Deduced a trap composed of 25 places in 782 ms of which 1 ms to minimize.
[2023-03-18 23:19:17] [INFO ] Deduced a trap composed of 22 places in 1000 ms of which 1 ms to minimize.
[2023-03-18 23:19:17] [INFO ] Deduced a trap composed of 21 places in 793 ms of which 1 ms to minimize.
[2023-03-18 23:19:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 7339 ms
[2023-03-18 23:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 47 ms returned sat
[2023-03-18 23:19:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-18 23:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:19:19] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2023-03-18 23:19:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:19:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2023-03-18 23:19:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-18 23:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:19:20] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2023-03-18 23:19:20] [INFO ] [Nat]Added 497 Read/Feed constraints in 219 ms returned sat
[2023-03-18 23:19:21] [INFO ] Deduced a trap composed of 146 places in 1013 ms of which 1 ms to minimize.
[2023-03-18 23:19:22] [INFO ] Deduced a trap composed of 61 places in 1008 ms of which 1 ms to minimize.
[2023-03-18 23:19:23] [INFO ] Deduced a trap composed of 43 places in 810 ms of which 1 ms to minimize.
[2023-03-18 23:19:24] [INFO ] Deduced a trap composed of 66 places in 824 ms of which 2 ms to minimize.
[2023-03-18 23:19:25] [INFO ] Deduced a trap composed of 47 places in 962 ms of which 2 ms to minimize.
[2023-03-18 23:19:26] [INFO ] Deduced a trap composed of 104 places in 951 ms of which 2 ms to minimize.
[2023-03-18 23:19:27] [INFO ] Deduced a trap composed of 89 places in 1052 ms of which 1 ms to minimize.
[2023-03-18 23:19:28] [INFO ] Deduced a trap composed of 117 places in 1027 ms of which 3 ms to minimize.
[2023-03-18 23:19:29] [INFO ] Deduced a trap composed of 65 places in 1012 ms of which 2 ms to minimize.
[2023-03-18 23:19:31] [INFO ] Deduced a trap composed of 241 places in 1011 ms of which 3 ms to minimize.
[2023-03-18 23:19:32] [INFO ] Deduced a trap composed of 138 places in 1203 ms of which 1 ms to minimize.
[2023-03-18 23:19:33] [INFO ] Deduced a trap composed of 148 places in 824 ms of which 1 ms to minimize.
[2023-03-18 23:19:34] [INFO ] Deduced a trap composed of 138 places in 977 ms of which 1 ms to minimize.
[2023-03-18 23:19:35] [INFO ] Deduced a trap composed of 164 places in 1111 ms of which 2 ms to minimize.
[2023-03-18 23:19:36] [INFO ] Deduced a trap composed of 58 places in 1038 ms of which 2 ms to minimize.
[2023-03-18 23:19:37] [INFO ] Deduced a trap composed of 74 places in 927 ms of which 2 ms to minimize.
[2023-03-18 23:19:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 17578 ms
[2023-03-18 23:19:38] [INFO ] Computed and/alt/rep : 1800/5000/1800 causal constraints (skipped 112 transitions) in 174 ms.
[2023-03-18 23:19:55] [INFO ] Deduced a trap composed of 94 places in 1389 ms of which 1 ms to minimize.
[2023-03-18 23:19:56] [INFO ] Deduced a trap composed of 20 places in 1100 ms of which 2 ms to minimize.
[2023-03-18 23:19:57] [INFO ] Deduced a trap composed of 34 places in 1233 ms of which 2 ms to minimize.
[2023-03-18 23:19:59] [INFO ] Deduced a trap composed of 33 places in 1240 ms of which 1 ms to minimize.
[2023-03-18 23:20:00] [INFO ] Deduced a trap composed of 43 places in 896 ms of which 1 ms to minimize.
[2023-03-18 23:20:01] [INFO ] Deduced a trap composed of 11 places in 1076 ms of which 1 ms to minimize.
[2023-03-18 23:20:02] [INFO ] Deduced a trap composed of 36 places in 1095 ms of which 2 ms to minimize.
[2023-03-18 23:20:04] [INFO ] Deduced a trap composed of 23 places in 1400 ms of which 2 ms to minimize.
[2023-03-18 23:20:04] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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) : [8, 7, 7, 8, 7, 8] Max seen :[1, 7, 7, 7, 7, 7]
FORMULA Peterson-COL-7-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 456 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2256/2256 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1152 transition count 2208
Deduced a syphon composed of 48 places in 6 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1104 transition count 2208
Applied a total of 96 rules in 161 ms. Remains 1104 /1152 variables (removed 48) and now considering 2208/2256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1104/1152 places, 2208/2256 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1104 cols
[2023-03-18 23:20:04] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15905 ms. (steps per millisecond=62 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2251 ms. (steps per millisecond=444 ) properties (out of 3) seen :3
Finished Best-First random walk after 576604 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=115 )
Finished Best-First random walk after 594784 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=118 )
[2023-03-18 23:20:33] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1104 cols
[2023-03-18 23:20:33] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-18 23:20:33] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-18 23:20:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-18 23:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:20:34] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2023-03-18 23:20:34] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:20:34] [INFO ] [Real]Added 497 Read/Feed constraints in 134 ms returned sat
[2023-03-18 23:20:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:20:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2023-03-18 23:20:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-18 23:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:20:35] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2023-03-18 23:20:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 229 ms returned sat
[2023-03-18 23:20:36] [INFO ] Deduced a trap composed of 31 places in 892 ms of which 6 ms to minimize.
[2023-03-18 23:20:38] [INFO ] Deduced a trap composed of 39 places in 956 ms of which 1 ms to minimize.
[2023-03-18 23:20:38] [INFO ] Deduced a trap composed of 48 places in 852 ms of which 1 ms to minimize.
[2023-03-18 23:20:39] [INFO ] Deduced a trap composed of 13 places in 885 ms of which 2 ms to minimize.
[2023-03-18 23:20:41] [INFO ] Deduced a trap composed of 52 places in 979 ms of which 1 ms to minimize.
[2023-03-18 23:20:42] [INFO ] Deduced a trap composed of 67 places in 876 ms of which 1 ms to minimize.
[2023-03-18 23:20:43] [INFO ] Deduced a trap composed of 51 places in 928 ms of which 2 ms to minimize.
[2023-03-18 23:20:44] [INFO ] Deduced a trap composed of 28 places in 922 ms of which 2 ms to minimize.
[2023-03-18 23:20:45] [INFO ] Deduced a trap composed of 15 places in 914 ms of which 1 ms to minimize.
[2023-03-18 23:20:46] [INFO ] Deduced a trap composed of 60 places in 855 ms of which 1 ms to minimize.
[2023-03-18 23:20:47] [INFO ] Deduced a trap composed of 17 places in 848 ms of which 1 ms to minimize.
[2023-03-18 23:20:48] [INFO ] Deduced a trap composed of 42 places in 823 ms of which 1 ms to minimize.
[2023-03-18 23:20:49] [INFO ] Deduced a trap composed of 69 places in 988 ms of which 1 ms to minimize.
[2023-03-18 23:20:50] [INFO ] Deduced a trap composed of 61 places in 701 ms of which 1 ms to minimize.
[2023-03-18 23:20:51] [INFO ] Deduced a trap composed of 71 places in 775 ms of which 1 ms to minimize.
[2023-03-18 23:20:51] [INFO ] Deduced a trap composed of 50 places in 835 ms of which 1 ms to minimize.
[2023-03-18 23:20:52] [INFO ] Deduced a trap composed of 31 places in 682 ms of which 1 ms to minimize.
[2023-03-18 23:20:53] [INFO ] Deduced a trap composed of 83 places in 708 ms of which 1 ms to minimize.
[2023-03-18 23:20:54] [INFO ] Deduced a trap composed of 39 places in 857 ms of which 1 ms to minimize.
[2023-03-18 23:20:55] [INFO ] Deduced a trap composed of 50 places in 936 ms of which 1 ms to minimize.
[2023-03-18 23:20:56] [INFO ] Deduced a trap composed of 121 places in 646 ms of which 2 ms to minimize.
[2023-03-18 23:20:57] [INFO ] Deduced a trap composed of 57 places in 760 ms of which 1 ms to minimize.
[2023-03-18 23:20:57] [INFO ] Deduced a trap composed of 49 places in 724 ms of which 1 ms to minimize.
[2023-03-18 23:20:59] [INFO ] Deduced a trap composed of 69 places in 939 ms of which 1 ms to minimize.
[2023-03-18 23:21:00] [INFO ] Deduced a trap composed of 33 places in 916 ms of which 1 ms to minimize.
[2023-03-18 23:21:01] [INFO ] Deduced a trap composed of 49 places in 855 ms of which 1 ms to minimize.
[2023-03-18 23:21:02] [INFO ] Deduced a trap composed of 15 places in 1050 ms of which 2 ms to minimize.
[2023-03-18 23:21:03] [INFO ] Deduced a trap composed of 40 places in 1025 ms of which 1 ms to minimize.
[2023-03-18 23:21:04] [INFO ] Deduced a trap composed of 36 places in 825 ms of which 2 ms to minimize.
[2023-03-18 23:21:05] [INFO ] Deduced a trap composed of 63 places in 989 ms of which 1 ms to minimize.
[2023-03-18 23:21:06] [INFO ] Deduced a trap composed of 41 places in 864 ms of which 2 ms to minimize.
[2023-03-18 23:21:07] [INFO ] Deduced a trap composed of 15 places in 805 ms of which 2 ms to minimize.
[2023-03-18 23:21:08] [INFO ] Deduced a trap composed of 73 places in 999 ms of which 1 ms to minimize.
[2023-03-18 23:21:09] [INFO ] Deduced a trap composed of 75 places in 967 ms of which 1 ms to minimize.
[2023-03-18 23:21:11] [INFO ] Deduced a trap composed of 21 places in 921 ms of which 1 ms to minimize.
[2023-03-18 23:21:11] [INFO ] Deduced a trap composed of 159 places in 844 ms of which 1 ms to minimize.
[2023-03-18 23:21:12] [INFO ] Deduced a trap composed of 113 places in 661 ms of which 1 ms to minimize.
[2023-03-18 23:21:13] [INFO ] Deduced a trap composed of 91 places in 853 ms of which 1 ms to minimize.
[2023-03-18 23:21:14] [INFO ] Deduced a trap composed of 74 places in 835 ms of which 1 ms to minimize.
[2023-03-18 23:21:15] [INFO ] Deduced a trap composed of 92 places in 671 ms of which 1 ms to minimize.
[2023-03-18 23:21:16] [INFO ] Deduced a trap composed of 71 places in 733 ms of which 1 ms to minimize.
[2023-03-18 23:21:17] [INFO ] Deduced a trap composed of 60 places in 929 ms of which 2 ms to minimize.
[2023-03-18 23:21:18] [INFO ] Deduced a trap composed of 43 places in 898 ms of which 1 ms to minimize.
[2023-03-18 23:21:19] [INFO ] Deduced a trap composed of 60 places in 845 ms of which 1 ms to minimize.
[2023-03-18 23:21:20] [INFO ] Deduced a trap composed of 33 places in 914 ms of which 2 ms to minimize.
[2023-03-18 23:21:20] [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: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-18 23:21:20] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2023-03-18 23:21:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-18 23:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:21:21] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2023-03-18 23:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:21:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2023-03-18 23:21:21] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2023-03-18 23:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:21:22] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2023-03-18 23:21:22] [INFO ] [Nat]Added 497 Read/Feed constraints in 210 ms returned sat
[2023-03-18 23:21:23] [INFO ] Deduced a trap composed of 154 places in 1018 ms of which 2 ms to minimize.
[2023-03-18 23:21:24] [INFO ] Deduced a trap composed of 99 places in 1105 ms of which 1 ms to minimize.
[2023-03-18 23:21:25] [INFO ] Deduced a trap composed of 113 places in 1171 ms of which 1 ms to minimize.
[2023-03-18 23:21:26] [INFO ] Deduced a trap composed of 139 places in 1002 ms of which 1 ms to minimize.
[2023-03-18 23:21:27] [INFO ] Deduced a trap composed of 134 places in 828 ms of which 1 ms to minimize.
[2023-03-18 23:21:29] [INFO ] Deduced a trap composed of 119 places in 1189 ms of which 2 ms to minimize.
[2023-03-18 23:21:30] [INFO ] Deduced a trap composed of 125 places in 1173 ms of which 1 ms to minimize.
[2023-03-18 23:21:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8244 ms
[2023-03-18 23:21:30] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 126 ms.
[2023-03-18 23:21:42] [INFO ] Deduced a trap composed of 151 places in 1264 ms of which 2 ms to minimize.
[2023-03-18 23:21:43] [INFO ] Deduced a trap composed of 139 places in 1179 ms of which 1 ms to minimize.
[2023-03-18 23:21:44] [INFO ] Deduced a trap composed of 210 places in 1017 ms of which 1 ms to minimize.
[2023-03-18 23:21:45] [INFO ] Deduced a trap composed of 87 places in 852 ms of which 1 ms to minimize.
[2023-03-18 23:21:46] [INFO ] Deduced a trap composed of 135 places in 1016 ms of which 1 ms to minimize.
[2023-03-18 23:21:47] [INFO ] Deduced a trap composed of 30 places in 883 ms of which 1 ms to minimize.
[2023-03-18 23:21:49] [INFO ] Deduced a trap composed of 13 places in 949 ms of which 1 ms to minimize.
[2023-03-18 23:21:50] [INFO ] Deduced a trap composed of 174 places in 1128 ms of which 2 ms to minimize.
[2023-03-18 23:21:51] [INFO ] Deduced a trap composed of 13 places in 1101 ms of which 1 ms to minimize.
[2023-03-18 23:21:52] [INFO ] Deduced a trap composed of 29 places in 1077 ms of which 4 ms to minimize.
[2023-03-18 23:21:53] [INFO ] Deduced a trap composed of 34 places in 983 ms of which 1 ms to minimize.
[2023-03-18 23:21:54] [INFO ] Deduced a trap composed of 11 places in 888 ms of which 1 ms to minimize.
[2023-03-18 23:21:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 14199 ms
[2023-03-18 23:21:55] [INFO ] Added : 240 causal constraints over 48 iterations in 24713 ms. Result :sat
Minimization took 827 ms.
[2023-03-18 23:21:56] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-18 23:21:56] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2023-03-18 23:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:21:57] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2023-03-18 23:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:21:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2023-03-18 23:21:57] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-18 23:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:21:58] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2023-03-18 23:21:58] [INFO ] [Nat]Added 497 Read/Feed constraints in 206 ms returned sat
[2023-03-18 23:21:59] [INFO ] Deduced a trap composed of 154 places in 1026 ms of which 1 ms to minimize.
[2023-03-18 23:22:00] [INFO ] Deduced a trap composed of 99 places in 1009 ms of which 1 ms to minimize.
[2023-03-18 23:22:01] [INFO ] Deduced a trap composed of 113 places in 990 ms of which 1 ms to minimize.
[2023-03-18 23:22:03] [INFO ] Deduced a trap composed of 139 places in 1121 ms of which 1 ms to minimize.
[2023-03-18 23:22:04] [INFO ] Deduced a trap composed of 134 places in 1090 ms of which 2 ms to minimize.
[2023-03-18 23:22:05] [INFO ] Deduced a trap composed of 119 places in 1140 ms of which 1 ms to minimize.
[2023-03-18 23:22:06] [INFO ] Deduced a trap composed of 125 places in 995 ms of which 1 ms to minimize.
[2023-03-18 23:22:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8100 ms
[2023-03-18 23:22:06] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 126 ms.
[2023-03-18 23:22:18] [INFO ] Deduced a trap composed of 151 places in 1122 ms of which 1 ms to minimize.
[2023-03-18 23:22:19] [INFO ] Deduced a trap composed of 139 places in 991 ms of which 1 ms to minimize.
[2023-03-18 23:22:20] [INFO ] Deduced a trap composed of 210 places in 998 ms of which 1 ms to minimize.
[2023-03-18 23:22:21] [INFO ] Deduced a trap composed of 87 places in 1005 ms of which 2 ms to minimize.
[2023-03-18 23:22:22] [INFO ] Deduced a trap composed of 135 places in 1072 ms of which 1 ms to minimize.
[2023-03-18 23:22:23] [INFO ] Deduced a trap composed of 30 places in 1157 ms of which 1 ms to minimize.
[2023-03-18 23:22:25] [INFO ] Deduced a trap composed of 13 places in 961 ms of which 1 ms to minimize.
[2023-03-18 23:22:26] [INFO ] Deduced a trap composed of 174 places in 981 ms of which 1 ms to minimize.
[2023-03-18 23:22:27] [INFO ] Deduced a trap composed of 13 places in 1149 ms of which 2 ms to minimize.
[2023-03-18 23:22:28] [INFO ] Deduced a trap composed of 29 places in 901 ms of which 1 ms to minimize.
[2023-03-18 23:22:29] [INFO ] Deduced a trap composed of 34 places in 975 ms of which 1 ms to minimize.
[2023-03-18 23:22:30] [INFO ] Deduced a trap composed of 11 places in 957 ms of which 1 ms to minimize.
[2023-03-18 23:22:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 13910 ms
[2023-03-18 23:22:30] [INFO ] Added : 240 causal constraints over 48 iterations in 24296 ms. Result :sat
Minimization took 780 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8] Max seen :[1, 7, 7]
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 62 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 62 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 52 ms. Remains 1104 /1104 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-18 23:22:33] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-18 23:22:33] [INFO ] Invariant cache hit.
[2023-03-18 23:22:34] [INFO ] Implicit Places using invariants in 1015 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1024 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 76 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 1155 ms. Remains : 1096/1104 places, 2208/2208 transitions.
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:22:34] [INFO ] Computed 23 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 15146 ms. (steps per millisecond=66 ) properties (out of 3) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2116 ms. (steps per millisecond=472 ) properties (out of 3) seen :3
Interrupted Best-First random walk after 592318 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 2
Interrupted Best-First random walk after 619705 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 2
[2023-03-18 23:23:01] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:23:01] [INFO ] Computed 23 place invariants in 10 ms
[2023-03-18 23:23:01] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-18 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:23:02] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2023-03-18 23:23:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:23:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-18 23:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:23:03] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-18 23:23:03] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:23:03] [INFO ] [Nat]Added 497 Read/Feed constraints in 281 ms returned sat
[2023-03-18 23:23:04] [INFO ] Deduced a trap composed of 33 places in 923 ms of which 1 ms to minimize.
[2023-03-18 23:23:05] [INFO ] Deduced a trap composed of 49 places in 914 ms of which 1 ms to minimize.
[2023-03-18 23:23:06] [INFO ] Deduced a trap composed of 94 places in 1056 ms of which 2 ms to minimize.
[2023-03-18 23:23:07] [INFO ] Deduced a trap composed of 74 places in 858 ms of which 1 ms to minimize.
[2023-03-18 23:23:08] [INFO ] Deduced a trap composed of 81 places in 739 ms of which 1 ms to minimize.
[2023-03-18 23:23:09] [INFO ] Deduced a trap composed of 29 places in 881 ms of which 2 ms to minimize.
[2023-03-18 23:23:10] [INFO ] Deduced a trap composed of 15 places in 867 ms of which 1 ms to minimize.
[2023-03-18 23:23:11] [INFO ] Deduced a trap composed of 28 places in 1039 ms of which 1 ms to minimize.
[2023-03-18 23:23:12] [INFO ] Deduced a trap composed of 83 places in 908 ms of which 1 ms to minimize.
[2023-03-18 23:23:13] [INFO ] Deduced a trap composed of 24 places in 861 ms of which 2 ms to minimize.
[2023-03-18 23:23:14] [INFO ] Deduced a trap composed of 42 places in 853 ms of which 2 ms to minimize.
[2023-03-18 23:23:15] [INFO ] Deduced a trap composed of 24 places in 853 ms of which 1 ms to minimize.
[2023-03-18 23:23:16] [INFO ] Deduced a trap composed of 24 places in 868 ms of which 1 ms to minimize.
[2023-03-18 23:23:17] [INFO ] Deduced a trap composed of 44 places in 841 ms of which 2 ms to minimize.
[2023-03-18 23:23:18] [INFO ] Deduced a trap composed of 74 places in 1035 ms of which 1 ms to minimize.
[2023-03-18 23:23:19] [INFO ] Deduced a trap composed of 42 places in 642 ms of which 0 ms to minimize.
[2023-03-18 23:23:20] [INFO ] Deduced a trap composed of 119 places in 709 ms of which 1 ms to minimize.
[2023-03-18 23:23:20] [INFO ] Deduced a trap composed of 15 places in 698 ms of which 1 ms to minimize.
[2023-03-18 23:23:21] [INFO ] Deduced a trap composed of 15 places in 849 ms of which 1 ms to minimize.
[2023-03-18 23:23:22] [INFO ] Deduced a trap composed of 42 places in 782 ms of which 1 ms to minimize.
[2023-03-18 23:23:23] [INFO ] Deduced a trap composed of 15 places in 863 ms of which 2 ms to minimize.
[2023-03-18 23:23:24] [INFO ] Deduced a trap composed of 71 places in 829 ms of which 2 ms to minimize.
[2023-03-18 23:23:25] [INFO ] Deduced a trap composed of 94 places in 968 ms of which 1 ms to minimize.
[2023-03-18 23:23:26] [INFO ] Deduced a trap composed of 109 places in 781 ms of which 2 ms to minimize.
[2023-03-18 23:23:27] [INFO ] Deduced a trap composed of 119 places in 1022 ms of which 1 ms to minimize.
[2023-03-18 23:23:28] [INFO ] Deduced a trap composed of 79 places in 910 ms of which 1 ms to minimize.
[2023-03-18 23:23:29] [INFO ] Deduced a trap composed of 130 places in 808 ms of which 2 ms to minimize.
[2023-03-18 23:23:30] [INFO ] Deduced a trap composed of 106 places in 681 ms of which 1 ms to minimize.
[2023-03-18 23:23:31] [INFO ] Deduced a trap composed of 31 places in 752 ms of which 1 ms to minimize.
[2023-03-18 23:23:32] [INFO ] Deduced a trap composed of 93 places in 714 ms of which 1 ms to minimize.
[2023-03-18 23:23:33] [INFO ] Deduced a trap composed of 94 places in 837 ms of which 1 ms to minimize.
[2023-03-18 23:23:34] [INFO ] Deduced a trap composed of 123 places in 841 ms of which 2 ms to minimize.
[2023-03-18 23:23:35] [INFO ] Deduced a trap composed of 130 places in 956 ms of which 1 ms to minimize.
[2023-03-18 23:23:36] [INFO ] Deduced a trap composed of 111 places in 703 ms of which 1 ms to minimize.
[2023-03-18 23:23:37] [INFO ] Deduced a trap composed of 67 places in 719 ms of which 1 ms to minimize.
[2023-03-18 23:23:37] [INFO ] Deduced a trap composed of 94 places in 844 ms of which 1 ms to minimize.
[2023-03-18 23:23:38] [INFO ] Deduced a trap composed of 137 places in 701 ms of which 1 ms to minimize.
[2023-03-18 23:23:39] [INFO ] Deduced a trap composed of 59 places in 758 ms of which 1 ms to minimize.
[2023-03-18 23:23:40] [INFO ] Deduced a trap composed of 24 places in 817 ms of which 1 ms to minimize.
[2023-03-18 23:23:41] [INFO ] Deduced a trap composed of 24 places in 661 ms of which 1 ms to minimize.
[2023-03-18 23:23:42] [INFO ] Deduced a trap composed of 116 places in 996 ms of which 2 ms to minimize.
[2023-03-18 23:23:43] [INFO ] Deduced a trap composed of 49 places in 899 ms of which 2 ms to minimize.
[2023-03-18 23:23:44] [INFO ] Deduced a trap composed of 13 places in 934 ms of which 2 ms to minimize.
[2023-03-18 23:23:45] [INFO ] Deduced a trap composed of 57 places in 936 ms of which 2 ms to minimize.
[2023-03-18 23:23:46] [INFO ] Deduced a trap composed of 61 places in 803 ms of which 1 ms to minimize.
[2023-03-18 23:23:47] [INFO ] Deduced a trap composed of 24 places in 980 ms of which 1 ms to minimize.
[2023-03-18 23:23:47] [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: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-18 23:23:47] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2023-03-18 23:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:23:48] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2023-03-18 23:23:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:23:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-18 23:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:23:49] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-18 23:23:49] [INFO ] [Nat]Added 497 Read/Feed constraints in 226 ms returned sat
[2023-03-18 23:23:50] [INFO ] Deduced a trap composed of 177 places in 970 ms of which 13 ms to minimize.
[2023-03-18 23:23:51] [INFO ] Deduced a trap composed of 117 places in 978 ms of which 1 ms to minimize.
[2023-03-18 23:23:52] [INFO ] Deduced a trap composed of 166 places in 750 ms of which 1 ms to minimize.
[2023-03-18 23:23:53] [INFO ] Deduced a trap composed of 96 places in 891 ms of which 2 ms to minimize.
[2023-03-18 23:23:54] [INFO ] Deduced a trap composed of 80 places in 991 ms of which 4 ms to minimize.
[2023-03-18 23:23:55] [INFO ] Deduced a trap composed of 33 places in 1199 ms of which 1 ms to minimize.
[2023-03-18 23:23:56] [INFO ] Deduced a trap composed of 33 places in 971 ms of which 1 ms to minimize.
[2023-03-18 23:23:58] [INFO ] Deduced a trap composed of 34 places in 978 ms of which 1 ms to minimize.
[2023-03-18 23:23:59] [INFO ] Deduced a trap composed of 56 places in 964 ms of which 1 ms to minimize.
[2023-03-18 23:23:59] [INFO ] Deduced a trap composed of 13 places in 762 ms of which 1 ms to minimize.
[2023-03-18 23:24:00] [INFO ] Deduced a trap composed of 13 places in 942 ms of which 1 ms to minimize.
[2023-03-18 23:24:01] [INFO ] Deduced a trap composed of 75 places in 769 ms of which 2 ms to minimize.
[2023-03-18 23:24:02] [INFO ] Deduced a trap composed of 113 places in 694 ms of which 1 ms to minimize.
[2023-03-18 23:24:02] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 13043 ms
[2023-03-18 23:24:02] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 161 ms.
[2023-03-18 23:24:17] [INFO ] Deduced a trap composed of 77 places in 1046 ms of which 2 ms to minimize.
[2023-03-18 23:24:19] [INFO ] Deduced a trap composed of 84 places in 1074 ms of which 1 ms to minimize.
[2023-03-18 23:24:19] [INFO ] Deduced a trap composed of 87 places in 800 ms of which 2 ms to minimize.
[2023-03-18 23:24:20] [INFO ] Deduced a trap composed of 81 places in 845 ms of which 1 ms to minimize.
[2023-03-18 23:24:22] [INFO ] Deduced a trap composed of 88 places in 944 ms of which 2 ms to minimize.
[2023-03-18 23:24:23] [INFO ] Deduced a trap composed of 154 places in 996 ms of which 2 ms to minimize.
[2023-03-18 23:24:24] [INFO ] Deduced a trap composed of 13 places in 985 ms of which 1 ms to minimize.
[2023-03-18 23:24:25] [INFO ] Deduced a trap composed of 80 places in 1070 ms of which 1 ms to minimize.
[2023-03-18 23:24:26] [INFO ] Deduced a trap composed of 73 places in 782 ms of which 1 ms to minimize.
[2023-03-18 23:24:27] [INFO ] Deduced a trap composed of 171 places in 1085 ms of which 2 ms to minimize.
[2023-03-18 23:24:29] [INFO ] Deduced a trap composed of 77 places in 1132 ms of which 1 ms to minimize.
[2023-03-18 23:24:29] [INFO ] Deduced a trap composed of 125 places in 756 ms of which 1 ms to minimize.
[2023-03-18 23:24:31] [INFO ] Deduced a trap composed of 46 places in 879 ms of which 2 ms to minimize.
[2023-03-18 23:24:32] [INFO ] Deduced a trap composed of 75 places in 855 ms of which 1 ms to minimize.
[2023-03-18 23:24:32] [INFO ] Deduced a trap composed of 50 places in 846 ms of which 1 ms to minimize.
[2023-03-18 23:24:33] [INFO ] Deduced a trap composed of 41 places in 855 ms of which 2 ms to minimize.
[2023-03-18 23:24:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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-18 23:24:34] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 23:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:24:34] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2023-03-18 23:24:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:24:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-18 23:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:24:36] [INFO ] [Nat]Absence check using state equation in 802 ms returned sat
[2023-03-18 23:24:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 222 ms returned sat
[2023-03-18 23:24:37] [INFO ] Deduced a trap composed of 177 places in 766 ms of which 1 ms to minimize.
[2023-03-18 23:24:38] [INFO ] Deduced a trap composed of 117 places in 891 ms of which 2 ms to minimize.
[2023-03-18 23:24:39] [INFO ] Deduced a trap composed of 166 places in 974 ms of which 1 ms to minimize.
[2023-03-18 23:24:40] [INFO ] Deduced a trap composed of 96 places in 876 ms of which 1 ms to minimize.
[2023-03-18 23:24:40] [INFO ] Deduced a trap composed of 80 places in 784 ms of which 1 ms to minimize.
[2023-03-18 23:24:41] [INFO ] Deduced a trap composed of 33 places in 771 ms of which 1 ms to minimize.
[2023-03-18 23:24:42] [INFO ] Deduced a trap composed of 33 places in 978 ms of which 1 ms to minimize.
[2023-03-18 23:24:44] [INFO ] Deduced a trap composed of 34 places in 1110 ms of which 1 ms to minimize.
[2023-03-18 23:24:44] [INFO ] Deduced a trap composed of 56 places in 866 ms of which 1 ms to minimize.
[2023-03-18 23:24:45] [INFO ] Deduced a trap composed of 13 places in 812 ms of which 1 ms to minimize.
[2023-03-18 23:24:46] [INFO ] Deduced a trap composed of 13 places in 949 ms of which 2 ms to minimize.
[2023-03-18 23:24:48] [INFO ] Deduced a trap composed of 75 places in 1123 ms of which 2 ms to minimize.
[2023-03-18 23:24:49] [INFO ] Deduced a trap composed of 113 places in 844 ms of which 1 ms to minimize.
[2023-03-18 23:24:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 12989 ms
[2023-03-18 23:24:49] [INFO ] Computed and/alt/rep : 1752/5288/1752 causal constraints (skipped 112 transitions) in 197 ms.
[2023-03-18 23:25:04] [INFO ] Deduced a trap composed of 77 places in 1174 ms of which 1 ms to minimize.
[2023-03-18 23:25:05] [INFO ] Deduced a trap composed of 84 places in 994 ms of which 1 ms to minimize.
[2023-03-18 23:25:06] [INFO ] Deduced a trap composed of 87 places in 957 ms of which 2 ms to minimize.
[2023-03-18 23:25:07] [INFO ] Deduced a trap composed of 81 places in 888 ms of which 1 ms to minimize.
[2023-03-18 23:25:08] [INFO ] Deduced a trap composed of 88 places in 957 ms of which 2 ms to minimize.
[2023-03-18 23:25:10] [INFO ] Deduced a trap composed of 154 places in 986 ms of which 1 ms to minimize.
[2023-03-18 23:25:11] [INFO ] Deduced a trap composed of 13 places in 987 ms of which 1 ms to minimize.
[2023-03-18 23:25:12] [INFO ] Deduced a trap composed of 80 places in 1000 ms of which 1 ms to minimize.
[2023-03-18 23:25:13] [INFO ] Deduced a trap composed of 73 places in 1155 ms of which 1 ms to minimize.
[2023-03-18 23:25:14] [INFO ] Deduced a trap composed of 171 places in 991 ms of which 1 ms to minimize.
[2023-03-18 23:25:16] [INFO ] Deduced a trap composed of 77 places in 1142 ms of which 1 ms to minimize.
[2023-03-18 23:25:17] [INFO ] Deduced a trap composed of 125 places in 1079 ms of which 2 ms to minimize.
[2023-03-18 23:25:18] [INFO ] Deduced a trap composed of 46 places in 1048 ms of which 1 ms to minimize.
[2023-03-18 23:25:19] [INFO ] Deduced a trap composed of 75 places in 1150 ms of which 2 ms to minimize.
[2023-03-18 23:25:21] [INFO ] Deduced a trap composed of 50 places in 1044 ms of which 1 ms to minimize.
[2023-03-18 23:25:21] [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 2
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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) : [8, 8, 8] Max seen :[1, 7, 7]
Support contains 456 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Applied a total of 0 rules in 39 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 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 37 ms. Remains 1096 /1096 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-18 23:25:21] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-18 23:25:21] [INFO ] Invariant cache hit.
[2023-03-18 23:25:22] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2023-03-18 23:25:22] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-18 23:25:22] [INFO ] Invariant cache hit.
[2023-03-18 23:25:23] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:25:31] [INFO ] Implicit Places using invariants and state equation in 9152 ms returned []
Implicit Place search using SMT with State Equation took 10407 ms to find 0 implicit places.
[2023-03-18 23:25:31] [INFO ] Redundant transitions in 271 ms returned []
[2023-03-18 23:25:31] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
[2023-03-18 23:25:31] [INFO ] Invariant cache hit.
[2023-03-18 23:25:33] [INFO ] Dead Transitions using invariants and state equation in 1852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12591 ms. Remains : 1096/1096 places, 2208/2208 transitions.
Starting property specific reduction for Peterson-COL-7-UpperBounds-00
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:25:33] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
[2023-03-18 23:25:33] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:25:33] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-18 23:25:34] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-18 23:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:25:35] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2023-03-18 23:25:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:25:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-18 23:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:25:35] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-18 23:25:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:25:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 366 ms returned sat
[2023-03-18 23:25:37] [INFO ] Deduced a trap composed of 33 places in 961 ms of which 1 ms to minimize.
[2023-03-18 23:25:38] [INFO ] Deduced a trap composed of 49 places in 924 ms of which 2 ms to minimize.
[2023-03-18 23:25:39] [INFO ] Deduced a trap composed of 94 places in 913 ms of which 1 ms to minimize.
[2023-03-18 23:25:40] [INFO ] Deduced a trap composed of 74 places in 926 ms of which 1 ms to minimize.
[2023-03-18 23:25:40] [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: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:733)
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) : [8] Max seen :[1]
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 removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1096 transition count 2103
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 210 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 896 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 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 193 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 194 ms. Remains : 592/1096 places, 1704/2208 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 23:25:40] [INFO ] Computed 23 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3230 ms. (steps per millisecond=309 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 1) seen :1
[2023-03-18 23:25:44] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2023-03-18 23:25:44] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-18 23:25:44] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-18 23:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:25:45] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-18 23:25:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:25:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-18 23:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:25:45] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-18 23:25:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:25:46] [INFO ] [Nat]Added 497 Read/Feed constraints in 93 ms returned sat
[2023-03-18 23:25:46] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 1 ms to minimize.
[2023-03-18 23:25:46] [INFO ] Deduced a trap composed of 78 places in 387 ms of which 1 ms to minimize.
[2023-03-18 23:25:47] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 1 ms to minimize.
[2023-03-18 23:25:48] [INFO ] Deduced a trap composed of 39 places in 551 ms of which 1 ms to minimize.
[2023-03-18 23:25:48] [INFO ] Deduced a trap composed of 47 places in 509 ms of which 1 ms to minimize.
[2023-03-18 23:25:49] [INFO ] Deduced a trap composed of 11 places in 507 ms of which 1 ms to minimize.
[2023-03-18 23:25:49] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 1 ms to minimize.
[2023-03-18 23:25:50] [INFO ] Deduced a trap composed of 23 places in 521 ms of which 1 ms to minimize.
[2023-03-18 23:25:50] [INFO ] Deduced a trap composed of 89 places in 513 ms of which 1 ms to minimize.
[2023-03-18 23:25:51] [INFO ] Deduced a trap composed of 55 places in 516 ms of which 1 ms to minimize.
[2023-03-18 23:25:52] [INFO ] Deduced a trap composed of 38 places in 519 ms of which 1 ms to minimize.
[2023-03-18 23:25:52] [INFO ] Deduced a trap composed of 11 places in 513 ms of which 1 ms to minimize.
[2023-03-18 23:25:53] [INFO ] Deduced a trap composed of 24 places in 512 ms of which 1 ms to minimize.
[2023-03-18 23:25:53] [INFO ] Deduced a trap composed of 65 places in 521 ms of which 1 ms to minimize.
[2023-03-18 23:25:54] [INFO ] Deduced a trap composed of 15 places in 529 ms of which 3 ms to minimize.
[2023-03-18 23:25:54] [INFO ] Deduced a trap composed of 28 places in 412 ms of which 1 ms to minimize.
[2023-03-18 23:25:55] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 1 ms to minimize.
[2023-03-18 23:25:56] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 1 ms to minimize.
[2023-03-18 23:25:56] [INFO ] Deduced a trap composed of 29 places in 535 ms of which 1 ms to minimize.
[2023-03-18 23:25:57] [INFO ] Deduced a trap composed of 32 places in 578 ms of which 2 ms to minimize.
[2023-03-18 23:25:58] [INFO ] Deduced a trap composed of 23 places in 580 ms of which 1 ms to minimize.
[2023-03-18 23:25:58] [INFO ] Deduced a trap composed of 21 places in 622 ms of which 1 ms to minimize.
[2023-03-18 23:25:59] [INFO ] Deduced a trap composed of 22 places in 562 ms of which 1 ms to minimize.
[2023-03-18 23:26:00] [INFO ] Deduced a trap composed of 13 places in 528 ms of which 2 ms to minimize.
[2023-03-18 23:26:00] [INFO ] Deduced a trap composed of 14 places in 614 ms of which 1 ms to minimize.
[2023-03-18 23:26:01] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 1 ms to minimize.
[2023-03-18 23:26:01] [INFO ] Deduced a trap composed of 22 places in 555 ms of which 1 ms to minimize.
[2023-03-18 23:26:02] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2023-03-18 23:26:02] [INFO ] Deduced a trap composed of 43 places in 514 ms of which 1 ms to minimize.
[2023-03-18 23:26:03] [INFO ] Deduced a trap composed of 30 places in 501 ms of which 1 ms to minimize.
[2023-03-18 23:26:03] [INFO ] Deduced a trap composed of 38 places in 446 ms of which 0 ms to minimize.
[2023-03-18 23:26:04] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 1 ms to minimize.
[2023-03-18 23:26:05] [INFO ] Deduced a trap composed of 56 places in 584 ms of which 1 ms to minimize.
[2023-03-18 23:26:05] [INFO ] Deduced a trap composed of 33 places in 605 ms of which 1 ms to minimize.
[2023-03-18 23:26:06] [INFO ] Deduced a trap composed of 52 places in 471 ms of which 1 ms to minimize.
[2023-03-18 23:26:06] [INFO ] Deduced a trap composed of 59 places in 497 ms of which 1 ms to minimize.
[2023-03-18 23:26:07] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 1 ms to minimize.
[2023-03-18 23:26:07] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 1 ms to minimize.
[2023-03-18 23:26:08] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 1 ms to minimize.
[2023-03-18 23:26:08] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 1 ms to minimize.
[2023-03-18 23:26:08] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 1 ms to minimize.
[2023-03-18 23:26:09] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 1 ms to minimize.
[2023-03-18 23:26:09] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2023-03-18 23:26:10] [INFO ] Deduced a trap composed of 75 places in 511 ms of which 1 ms to minimize.
[2023-03-18 23:26:10] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 1 ms to minimize.
[2023-03-18 23:26:11] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2023-03-18 23:26:12] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-18 23:26:12] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 0 ms to minimize.
[2023-03-18 23:26:13] [INFO ] Deduced a trap composed of 60 places in 325 ms of which 1 ms to minimize.
[2023-03-18 23:26:13] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 1 ms to minimize.
[2023-03-18 23:26:13] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 1 ms to minimize.
[2023-03-18 23:26:14] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 0 ms to minimize.
[2023-03-18 23:26:14] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 0 ms to minimize.
[2023-03-18 23:26:15] [INFO ] Deduced a trap composed of 59 places in 356 ms of which 1 ms to minimize.
[2023-03-18 23:26:16] [INFO ] Deduced a trap composed of 75 places in 320 ms of which 1 ms to minimize.
[2023-03-18 23:26:16] [INFO ] Deduced a trap composed of 83 places in 299 ms of which 1 ms to minimize.
[2023-03-18 23:26:16] [INFO ] Deduced a trap composed of 64 places in 426 ms of which 0 ms to minimize.
[2023-03-18 23:26:18] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 1 ms to minimize.
[2023-03-18 23:26:18] [INFO ] Deduced a trap composed of 42 places in 330 ms of which 2 ms to minimize.
[2023-03-18 23:26:19] [INFO ] Deduced a trap composed of 60 places in 456 ms of which 1 ms to minimize.
[2023-03-18 23:26:19] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 1 ms to minimize.
[2023-03-18 23:26:20] [INFO ] Deduced a trap composed of 47 places in 347 ms of which 1 ms to minimize.
[2023-03-18 23:26:20] [INFO ] Deduced a trap composed of 106 places in 337 ms of which 1 ms to minimize.
[2023-03-18 23:26:21] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 1 ms to minimize.
[2023-03-18 23:26:21] [INFO ] Deduced a trap composed of 93 places in 351 ms of which 2 ms to minimize.
[2023-03-18 23:26:21] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2023-03-18 23:26:22] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 1 ms to minimize.
[2023-03-18 23:26:22] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2023-03-18 23:26:23] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2023-03-18 23:26:23] [INFO ] Deduced a trap composed of 30 places in 508 ms of which 1 ms to minimize.
[2023-03-18 23:26:24] [INFO ] Deduced a trap composed of 39 places in 510 ms of which 1 ms to minimize.
[2023-03-18 23:26:24] [INFO ] Deduced a trap composed of 56 places in 456 ms of which 1 ms to minimize.
[2023-03-18 23:26:27] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 41929 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
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 31 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 32 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 29 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2023-03-18 23:26:28] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 23:26:28] [INFO ] Invariant cache hit.
[2023-03-18 23:26:28] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-18 23:26:28] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 23:26:28] [INFO ] Invariant cache hit.
[2023-03-18 23:26:29] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:26:33] [INFO ] Implicit Places using invariants and state equation in 4361 ms returned []
Implicit Place search using SMT with State Equation took 4948 ms to find 0 implicit places.
[2023-03-18 23:26:33] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-18 23:26:33] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
[2023-03-18 23:26:33] [INFO ] Invariant cache hit.
[2023-03-18 23:26:34] [INFO ] Dead Transitions using invariants and state equation in 1390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6499 ms. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-00 in 60862 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-09
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:26:34] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :2
[2023-03-18 23:26:34] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:26:34] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-18 23:26:34] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-18 23:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:26:35] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2023-03-18 23:26:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:26:35] [INFO ] [Real]Added 497 Read/Feed constraints in 93 ms returned sat
[2023-03-18 23:26:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:26:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-18 23:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:26:37] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2023-03-18 23:26:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 195 ms returned sat
[2023-03-18 23:26:38] [INFO ] Deduced a trap composed of 102 places in 702 ms of which 1 ms to minimize.
[2023-03-18 23:26:39] [INFO ] Deduced a trap composed of 116 places in 958 ms of which 1 ms to minimize.
[2023-03-18 23:26:40] [INFO ] Deduced a trap composed of 86 places in 873 ms of which 2 ms to minimize.
[2023-03-18 23:26:41] [INFO ] Deduced a trap composed of 105 places in 930 ms of which 1 ms to minimize.
[2023-03-18 23:26: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: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:733)
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) : [448] Max seen :[5]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 72 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:26:41] [INFO ] Computed 23 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8831 ms. (steps per millisecond=113 ) properties (out of 1) seen :6
Finished Best-First random walk after 668675 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=133 )
[2023-03-18 23:26:55] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:26:55] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-18 23:26:55] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-18 23:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:26:56] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2023-03-18 23:26:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:26:56] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-18 23:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:26:57] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2023-03-18 23:26:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:26:57] [INFO ] [Nat]Added 497 Read/Feed constraints in 188 ms returned sat
[2023-03-18 23:26:58] [INFO ] Deduced a trap composed of 30 places in 989 ms of which 2 ms to minimize.
[2023-03-18 23:26:59] [INFO ] Deduced a trap composed of 51 places in 1080 ms of which 1 ms to minimize.
[2023-03-18 23:27:00] [INFO ] Deduced a trap composed of 35 places in 1066 ms of which 1 ms to minimize.
[2023-03-18 23:27:01] [INFO ] Deduced a trap composed of 31 places in 907 ms of which 2 ms to minimize.
[2023-03-18 23:27:02] [INFO ] Deduced a trap composed of 34 places in 911 ms of which 2 ms to minimize.
[2023-03-18 23:27:03] [INFO ] Deduced a trap composed of 51 places in 970 ms of which 2 ms to minimize.
[2023-03-18 23:27:04] [INFO ] Deduced a trap composed of 51 places in 1014 ms of which 1 ms to minimize.
[2023-03-18 23:27:05] [INFO ] Deduced a trap composed of 47 places in 640 ms of which 1 ms to minimize.
[2023-03-18 23:27:06] [INFO ] Deduced a trap composed of 46 places in 959 ms of which 2 ms to minimize.
[2023-03-18 23:27:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 9438 ms
[2023-03-18 23:27:07] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 210 ms.
[2023-03-18 23:27:17] [INFO ] Deduced a trap composed of 68 places in 1050 ms of which 1 ms to minimize.
[2023-03-18 23:27:18] [INFO ] Deduced a trap composed of 168 places in 996 ms of which 2 ms to minimize.
[2023-03-18 23:27:19] [INFO ] Deduced a trap composed of 47 places in 845 ms of which 1 ms to minimize.
[2023-03-18 23:27:20] [INFO ] Deduced a trap composed of 37 places in 869 ms of which 1 ms to minimize.
[2023-03-18 23:27:21] [INFO ] Deduced a trap composed of 51 places in 1115 ms of which 2 ms to minimize.
[2023-03-18 23:27:22] [INFO ] Deduced a trap composed of 77 places in 1139 ms of which 2 ms to minimize.
[2023-03-18 23:27:23] [INFO ] Deduced a trap composed of 60 places in 1044 ms of which 1 ms to minimize.
[2023-03-18 23:27:25] [INFO ] Deduced a trap composed of 47 places in 1005 ms of which 1 ms to minimize.
[2023-03-18 23:27:26] [INFO ] Deduced a trap composed of 151 places in 860 ms of which 1 ms to minimize.
[2023-03-18 23:27:27] [INFO ] Deduced a trap composed of 118 places in 937 ms of which 2 ms to minimize.
[2023-03-18 23:27:28] [INFO ] Deduced a trap composed of 167 places in 858 ms of which 1 ms to minimize.
[2023-03-18 23:27:29] [INFO ] Deduced a trap composed of 196 places in 943 ms of which 2 ms to minimize.
[2023-03-18 23:27:30] [INFO ] Deduced a trap composed of 143 places in 887 ms of which 1 ms to minimize.
[2023-03-18 23:27:31] [INFO ] Deduced a trap composed of 163 places in 894 ms of which 1 ms to minimize.
[2023-03-18 23:27:32] [INFO ] Deduced a trap composed of 129 places in 631 ms of which 1 ms to minimize.
[2023-03-18 23:27:33] [INFO ] Deduced a trap composed of 48 places in 827 ms of which 1 ms to minimize.
[2023-03-18 23:27:34] [INFO ] Deduced a trap composed of 65 places in 976 ms of which 2 ms to minimize.
[2023-03-18 23:27:35] [INFO ] Deduced a trap composed of 73 places in 1008 ms of which 1 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Deduced a trap composed of 63 places in 1030 ms of which 1 ms to minimize.
[2023-03-18 23:27:37] [INFO ] Deduced a trap composed of 149 places in 1009 ms of which 2 ms to minimize.
[2023-03-18 23:27:39] [INFO ] Deduced a trap composed of 46 places in 917 ms of which 1 ms to minimize.
[2023-03-18 23:27:40] [INFO ] Deduced a trap composed of 74 places in 940 ms of which 1 ms to minimize.
[2023-03-18 23:27:40] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 24500 ms
[2023-03-18 23:27:40] [INFO ] Added : 202 causal constraints over 42 iterations in 33878 ms.(timeout) Result :sat
Minimization took 517 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 83 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 82 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-18 23:27:41] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:27:41] [INFO ] Invariant cache hit.
[2023-03-18 23:27:42] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2023-03-18 23:27:42] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:27:42] [INFO ] Invariant cache hit.
[2023-03-18 23:27:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:27:51] [INFO ] Implicit Places using invariants and state equation in 8949 ms returned []
Implicit Place search using SMT with State Equation took 9957 ms to find 0 implicit places.
[2023-03-18 23:27:51] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-18 23:27:51] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:27:51] [INFO ] Invariant cache hit.
[2023-03-18 23:27:53] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11749 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:27:53] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8636 ms. (steps per millisecond=115 ) properties (out of 1) seen :6
Finished Best-First random walk after 679367 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=135 )
[2023-03-18 23:28:06] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:28:06] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-18 23:28:07] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-18 23:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:28:07] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2023-03-18 23:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:28:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2023-03-18 23:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:28:08] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2023-03-18 23:28:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:28:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 289 ms returned sat
[2023-03-18 23:28:09] [INFO ] Deduced a trap composed of 30 places in 767 ms of which 1 ms to minimize.
[2023-03-18 23:28:10] [INFO ] Deduced a trap composed of 51 places in 867 ms of which 1 ms to minimize.
[2023-03-18 23:28:12] [INFO ] Deduced a trap composed of 35 places in 1044 ms of which 1 ms to minimize.
[2023-03-18 23:28:13] [INFO ] Deduced a trap composed of 31 places in 1148 ms of which 2 ms to minimize.
[2023-03-18 23:28:14] [INFO ] Deduced a trap composed of 34 places in 884 ms of which 2 ms to minimize.
[2023-03-18 23:28:15] [INFO ] Deduced a trap composed of 51 places in 1188 ms of which 2 ms to minimize.
[2023-03-18 23:28:16] [INFO ] Deduced a trap composed of 51 places in 1023 ms of which 2 ms to minimize.
[2023-03-18 23:28:17] [INFO ] Deduced a trap composed of 47 places in 1079 ms of which 1 ms to minimize.
[2023-03-18 23:28:18] [INFO ] Deduced a trap composed of 46 places in 821 ms of which 1 ms to minimize.
[2023-03-18 23:28:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 9828 ms
[2023-03-18 23:28:19] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 198 ms.
[2023-03-18 23:28:26] [INFO ] Deduced a trap composed of 68 places in 849 ms of which 2 ms to minimize.
[2023-03-18 23:28:27] [INFO ] Deduced a trap composed of 168 places in 1065 ms of which 2 ms to minimize.
[2023-03-18 23:28:28] [INFO ] Deduced a trap composed of 47 places in 1016 ms of which 1 ms to minimize.
[2023-03-18 23:28:30] [INFO ] Deduced a trap composed of 37 places in 983 ms of which 1 ms to minimize.
[2023-03-18 23:28:31] [INFO ] Deduced a trap composed of 51 places in 1219 ms of which 1 ms to minimize.
[2023-03-18 23:28:32] [INFO ] Deduced a trap composed of 77 places in 1051 ms of which 2 ms to minimize.
[2023-03-18 23:28:33] [INFO ] Deduced a trap composed of 60 places in 1222 ms of which 1 ms to minimize.
[2023-03-18 23:28:35] [INFO ] Deduced a trap composed of 47 places in 990 ms of which 1 ms to minimize.
[2023-03-18 23:28:35] [INFO ] Deduced a trap composed of 151 places in 784 ms of which 1 ms to minimize.
[2023-03-18 23:28:36] [INFO ] Deduced a trap composed of 118 places in 782 ms of which 1 ms to minimize.
[2023-03-18 23:28:37] [INFO ] Deduced a trap composed of 167 places in 864 ms of which 1 ms to minimize.
[2023-03-18 23:28:38] [INFO ] Deduced a trap composed of 196 places in 824 ms of which 1 ms to minimize.
[2023-03-18 23:28:40] [INFO ] Deduced a trap composed of 143 places in 1015 ms of which 2 ms to minimize.
[2023-03-18 23:28:41] [INFO ] Deduced a trap composed of 163 places in 797 ms of which 2 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Deduced a trap composed of 129 places in 788 ms of which 1 ms to minimize.
[2023-03-18 23:28:43] [INFO ] Deduced a trap composed of 48 places in 878 ms of which 1 ms to minimize.
[2023-03-18 23:28:43] [INFO ] Deduced a trap composed of 65 places in 841 ms of which 1 ms to minimize.
[2023-03-18 23:28:45] [INFO ] Deduced a trap composed of 73 places in 899 ms of which 1 ms to minimize.
[2023-03-18 23:28:46] [INFO ] Deduced a trap composed of 63 places in 993 ms of which 1 ms to minimize.
[2023-03-18 23:28:47] [INFO ] Deduced a trap composed of 149 places in 722 ms of which 1 ms to minimize.
[2023-03-18 23:28:48] [INFO ] Deduced a trap composed of 46 places in 765 ms of which 1 ms to minimize.
[2023-03-18 23:28:49] [INFO ] Deduced a trap composed of 74 places in 801 ms of which 1 ms to minimize.
[2023-03-18 23:28:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 23664 ms
[2023-03-18 23:28:49] [INFO ] Added : 202 causal constraints over 42 iterations in 30605 ms.(timeout) Result :sat
Minimization took 1300 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 32 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 31 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-18 23:28:51] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:28:51] [INFO ] Invariant cache hit.
[2023-03-18 23:28:52] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-18 23:28:52] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:28:52] [INFO ] Invariant cache hit.
[2023-03-18 23:28:53] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:29:01] [INFO ] Implicit Places using invariants and state equation in 8275 ms returned []
Implicit Place search using SMT with State Equation took 9076 ms to find 0 implicit places.
[2023-03-18 23:29:01] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-18 23:29:01] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:29:01] [INFO ] Invariant cache hit.
[2023-03-18 23:29:03] [INFO ] Dead Transitions using invariants and state equation in 2308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11483 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:29:03] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8628 ms. (steps per millisecond=115 ) properties (out of 1) seen :6
Finished Best-First random walk after 671015 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=134 )
[2023-03-18 23:29:17] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:29:17] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-18 23:29:17] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-18 23:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:29:18] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2023-03-18 23:29:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:29:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 23:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:29:19] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2023-03-18 23:29:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:29:19] [INFO ] [Nat]Added 497 Read/Feed constraints in 176 ms returned sat
[2023-03-18 23:29:20] [INFO ] Deduced a trap composed of 59 places in 856 ms of which 1 ms to minimize.
[2023-03-18 23:29:21] [INFO ] Deduced a trap composed of 117 places in 866 ms of which 1 ms to minimize.
[2023-03-18 23:29:22] [INFO ] Deduced a trap composed of 84 places in 880 ms of which 1 ms to minimize.
[2023-03-18 23:29:22] [INFO ] Deduced a trap composed of 151 places in 707 ms of which 1 ms to minimize.
[2023-03-18 23:29:23] [INFO ] Deduced a trap composed of 105 places in 720 ms of which 1 ms to minimize.
[2023-03-18 23:29:24] [INFO ] Deduced a trap composed of 63 places in 769 ms of which 1 ms to minimize.
[2023-03-18 23:29:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5498 ms
[2023-03-18 23:29:24] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 145 ms.
[2023-03-18 23:29:32] [INFO ] Deduced a trap composed of 124 places in 861 ms of which 2 ms to minimize.
[2023-03-18 23:29:33] [INFO ] Deduced a trap composed of 60 places in 793 ms of which 1 ms to minimize.
[2023-03-18 23:29:34] [INFO ] Deduced a trap composed of 71 places in 792 ms of which 2 ms to minimize.
[2023-03-18 23:29:35] [INFO ] Deduced a trap composed of 13 places in 823 ms of which 1 ms to minimize.
[2023-03-18 23:29:36] [INFO ] Deduced a trap composed of 51 places in 777 ms of which 1 ms to minimize.
[2023-03-18 23:29:37] [INFO ] Deduced a trap composed of 41 places in 820 ms of which 1 ms to minimize.
[2023-03-18 23:29:38] [INFO ] Deduced a trap composed of 48 places in 1094 ms of which 1 ms to minimize.
[2023-03-18 23:29:39] [INFO ] Deduced a trap composed of 15 places in 980 ms of which 2 ms to minimize.
[2023-03-18 23:29:40] [INFO ] Deduced a trap composed of 34 places in 1042 ms of which 2 ms to minimize.
[2023-03-18 23:29:42] [INFO ] Deduced a trap composed of 100 places in 896 ms of which 1 ms to minimize.
[2023-03-18 23:29:42] [INFO ] Deduced a trap composed of 78 places in 659 ms of which 1 ms to minimize.
[2023-03-18 23:29:43] [INFO ] Deduced a trap composed of 91 places in 650 ms of which 1 ms to minimize.
[2023-03-18 23:29:44] [INFO ] Deduced a trap composed of 128 places in 657 ms of which 2 ms to minimize.
[2023-03-18 23:29:45] [INFO ] Deduced a trap composed of 147 places in 614 ms of which 1 ms to minimize.
[2023-03-18 23:29:46] [INFO ] Deduced a trap composed of 89 places in 920 ms of which 1 ms to minimize.
[2023-03-18 23:29:47] [INFO ] Deduced a trap composed of 84 places in 890 ms of which 2 ms to minimize.
[2023-03-18 23:29:48] [INFO ] Deduced a trap composed of 134 places in 616 ms of which 1 ms to minimize.
[2023-03-18 23:29:49] [INFO ] Deduced a trap composed of 107 places in 814 ms of which 1 ms to minimize.
[2023-03-18 23:29:50] [INFO ] Deduced a trap composed of 87 places in 784 ms of which 1 ms to minimize.
[2023-03-18 23:29:51] [INFO ] Deduced a trap composed of 130 places in 715 ms of which 2 ms to minimize.
[2023-03-18 23:29:52] [INFO ] Deduced a trap composed of 158 places in 738 ms of which 4 ms to minimize.
[2023-03-18 23:29:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 21039 ms
[2023-03-18 23:29:53] [INFO ] Added : 275 causal constraints over 55 iterations in 28211 ms.(timeout) Result :sat
Minimization took 842 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 33 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 32 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-18 23:29:54] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:29:54] [INFO ] Invariant cache hit.
[2023-03-18 23:29:55] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-18 23:29:55] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:29:55] [INFO ] Invariant cache hit.
[2023-03-18 23:29:56] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:30:04] [INFO ] Implicit Places using invariants and state equation in 8898 ms returned []
Implicit Place search using SMT with State Equation took 9710 ms to find 0 implicit places.
[2023-03-18 23:30:04] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-18 23:30:04] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:30:04] [INFO ] Invariant cache hit.
[2023-03-18 23:30:06] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11458 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-COL-7-UpperBounds-09 in 211826 ms.
Starting property specific reduction for Peterson-COL-7-UpperBounds-14
Normalized transition count is 1872 out of 2208 initially.
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:30:06] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :6
[2023-03-18 23:30:06] [INFO ] Flow matrix only has 1872 transitions (discarded 336 similar events)
// Phase 1: matrix 1872 rows 1096 cols
[2023-03-18 23:30:06] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-18 23:30:06] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-18 23:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:30:07] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2023-03-18 23:30:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:30:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-18 23:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:30:08] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2023-03-18 23:30:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:30:08] [INFO ] [Nat]Added 497 Read/Feed constraints in 239 ms returned sat
[2023-03-18 23:30:09] [INFO ] Deduced a trap composed of 141 places in 1023 ms of which 1 ms to minimize.
[2023-03-18 23:30:10] [INFO ] Deduced a trap composed of 129 places in 1006 ms of which 1 ms to minimize.
[2023-03-18 23:30:11] [INFO ] Deduced a trap composed of 57 places in 759 ms of which 1 ms to minimize.
[2023-03-18 23:30:12] [INFO ] Deduced a trap composed of 59 places in 812 ms of which 1 ms to minimize.
[2023-03-18 23: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: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:733)
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) : [448] Max seen :[6]
Support contains 448 out of 1096 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1096/1096 places, 2208/2208 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1088 transition count 2200
Applied a total of 16 rules in 44 ms. Remains 1088 /1096 variables (removed 8) and now considering 2200/2208 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1088/1096 places, 2200/2208 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:30:12] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9093 ms. (steps per millisecond=109 ) properties (out of 1) seen :6
Finished Best-First random walk after 628867 steps, including 1 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=125 )
[2023-03-18 23:30:26] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:30:26] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-18 23:30:26] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-18 23:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:30:27] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-18 23:30:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:30:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-18 23:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:30:28] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2023-03-18 23:30:28] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:30:29] [INFO ] [Nat]Added 497 Read/Feed constraints in 201 ms returned sat
[2023-03-18 23:30:30] [INFO ] Deduced a trap composed of 30 places in 932 ms of which 2 ms to minimize.
[2023-03-18 23:30:31] [INFO ] Deduced a trap composed of 51 places in 972 ms of which 2 ms to minimize.
[2023-03-18 23:30:32] [INFO ] Deduced a trap composed of 35 places in 1242 ms of which 1 ms to minimize.
[2023-03-18 23:30:33] [INFO ] Deduced a trap composed of 31 places in 915 ms of which 2 ms to minimize.
[2023-03-18 23:30:34] [INFO ] Deduced a trap composed of 34 places in 983 ms of which 1 ms to minimize.
[2023-03-18 23:30:35] [INFO ] Deduced a trap composed of 51 places in 900 ms of which 2 ms to minimize.
[2023-03-18 23:30:36] [INFO ] Deduced a trap composed of 51 places in 777 ms of which 1 ms to minimize.
[2023-03-18 23:30:37] [INFO ] Deduced a trap composed of 47 places in 747 ms of which 1 ms to minimize.
[2023-03-18 23:30:38] [INFO ] Deduced a trap composed of 46 places in 849 ms of which 1 ms to minimize.
[2023-03-18 23:30:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 9111 ms
[2023-03-18 23:30:38] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 127 ms.
[2023-03-18 23:30:45] [INFO ] Deduced a trap composed of 68 places in 1410 ms of which 2 ms to minimize.
[2023-03-18 23:30:46] [INFO ] Deduced a trap composed of 168 places in 1223 ms of which 1 ms to minimize.
[2023-03-18 23:30:48] [INFO ] Deduced a trap composed of 47 places in 932 ms of which 1 ms to minimize.
[2023-03-18 23:30:49] [INFO ] Deduced a trap composed of 37 places in 937 ms of which 2 ms to minimize.
[2023-03-18 23:30:50] [INFO ] Deduced a trap composed of 51 places in 1181 ms of which 3 ms to minimize.
[2023-03-18 23:30:51] [INFO ] Deduced a trap composed of 77 places in 853 ms of which 1 ms to minimize.
[2023-03-18 23:30:52] [INFO ] Deduced a trap composed of 60 places in 985 ms of which 1 ms to minimize.
[2023-03-18 23:30:53] [INFO ] Deduced a trap composed of 47 places in 1242 ms of which 1 ms to minimize.
[2023-03-18 23:30:54] [INFO ] Deduced a trap composed of 151 places in 764 ms of which 2 ms to minimize.
[2023-03-18 23:30:55] [INFO ] Deduced a trap composed of 118 places in 1027 ms of which 1 ms to minimize.
[2023-03-18 23:30:56] [INFO ] Deduced a trap composed of 167 places in 924 ms of which 1 ms to minimize.
[2023-03-18 23:30:58] [INFO ] Deduced a trap composed of 196 places in 1054 ms of which 1 ms to minimize.
[2023-03-18 23:30:59] [INFO ] Deduced a trap composed of 143 places in 1049 ms of which 1 ms to minimize.
[2023-03-18 23:31:00] [INFO ] Deduced a trap composed of 163 places in 773 ms of which 1 ms to minimize.
[2023-03-18 23:31:01] [INFO ] Deduced a trap composed of 129 places in 826 ms of which 1 ms to minimize.
[2023-03-18 23:31:02] [INFO ] Deduced a trap composed of 48 places in 767 ms of which 2 ms to minimize.
[2023-03-18 23:31:03] [INFO ] Deduced a trap composed of 65 places in 1006 ms of which 2 ms to minimize.
[2023-03-18 23:31:04] [INFO ] Deduced a trap composed of 73 places in 834 ms of which 1 ms to minimize.
[2023-03-18 23:31:05] [INFO ] Deduced a trap composed of 63 places in 1029 ms of which 2 ms to minimize.
[2023-03-18 23:31:06] [INFO ] Deduced a trap composed of 149 places in 858 ms of which 1 ms to minimize.
[2023-03-18 23:31:07] [INFO ] Deduced a trap composed of 46 places in 830 ms of which 1 ms to minimize.
[2023-03-18 23:31:08] [INFO ] Deduced a trap composed of 74 places in 812 ms of which 4 ms to minimize.
[2023-03-18 23:31:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 24931 ms
[2023-03-18 23:31:09] [INFO ] Added : 202 causal constraints over 42 iterations in 31117 ms.(timeout) Result :sat
Minimization took 1390 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 32 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 29 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2023-03-18 23:31:11] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:31:11] [INFO ] Invariant cache hit.
[2023-03-18 23:31:12] [INFO ] Implicit Places using invariants in 811 ms returned []
[2023-03-18 23:31:12] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:31:12] [INFO ] Invariant cache hit.
[2023-03-18 23:31:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 23:31:22] [INFO ] Implicit Places using invariants and state equation in 9740 ms returned []
Implicit Place search using SMT with State Equation took 10554 ms to find 0 implicit places.
[2023-03-18 23:31:22] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-18 23:31:22] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
[2023-03-18 23:31:22] [INFO ] Invariant cache hit.
[2023-03-18 23:31:24] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12221 ms. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:31:24] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9103 ms. (steps per millisecond=109 ) properties (out of 1) seen :7
Finished Best-First random walk after 668423 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=133 )
[2023-03-18 23:31:38] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2023-03-18 23:31:38] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-18 23:31:38] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [8] Max seen :[8]
FORMULA Peterson-COL-7-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-COL-7-UpperBounds-14 in 91995 ms.
[2023-03-18 23:31:39] [INFO ] Flatten gal took : 433 ms
[2023-03-18 23:31:39] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-18 23:31:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1096 places, 2208 transitions and 7792 arcs took 23 ms.
Total runtime 962666 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Peterson_COL_7_unf
(NrP: 1096 NrTr: 2208 NrArc: 7792)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.390sec
net check time: 0m 0.001sec
init dd package: 0m 3.309sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10257828 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093056 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.028sec
216323 723946 1157892
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="marciexred"
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 marciexred"
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 r266-smll-167863541200597"
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 ;