fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814479101045
Last Updated
May 14, 2023

About the Execution of LoLa+red for DatabaseWithMutex-COL-20

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
822.115 290217.00 314456.00 844.50 380 380 380 20 20 20 380 20 20 20 380 380 380 20 380 380 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.r103-tall-167814479101045.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 lolaxred
Input is DatabaseWithMutex-COL-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479101045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 38K Mar 5 18:22 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 DatabaseWithMutex-COL-20-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678312581968

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 21:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 21:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:56:23] [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-08 21:56:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-08 21:56:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 639 ms
[2023-03-08 21:56:24] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-08 21:56:24] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2023-03-08 21:56:24] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 21:56:24] [INFO ] Computed 4 place invariants in 8 ms
FORMULA DatabaseWithMutex-COL-20-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-08 21:56:24] [INFO ] Invariant cache hit.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 15 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned unsat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 21:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 21:56:24] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 16 ms.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 21:56:25] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:25] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 21:56:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:25] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 21:56:25] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-08 21:56:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:25] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:25] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 21:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-08 21:56:25] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:56:25] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [380, 380, 380, 20, 20, 380, 20, 20, 20, 380, 380, 380, 20, 380, 380]
FORMULA DatabaseWithMutex-COL-20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-08 21:56:25] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions 23200 arcs in 65 ms.
[2023-03-08 21:56:25] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1487 ms. (steps per millisecond=6 ) properties (out of 14) seen :1514
FORMULA DatabaseWithMutex-COL-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :119
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :22
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 :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :12
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 :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :22
// Phase 1: matrix 3200 rows 3260 cols
[2023-03-08 21:56:27] [INFO ] Computed 460 place invariants in 131 ms
[2023-03-08 21:56:28] [INFO ] [Real]Absence check using 59 positive place invariants in 68 ms returned sat
[2023-03-08 21:56:29] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 868 ms returned sat
[2023-03-08 21:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:30] [INFO ] [Real]Absence check using state equation in 1434 ms returned sat
[2023-03-08 21:56:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 63 ms returned sat
[2023-03-08 21:56:32] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 929 ms returned sat
[2023-03-08 21:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:33] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2023-03-08 21:56:34] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 209 ms.
[2023-03-08 21:56:34] [INFO ] Added : 20 causal constraints over 4 iterations in 975 ms. Result :sat
[2023-03-08 21:56:35] [INFO ] [Real]Absence check using 59 positive place invariants in 52 ms returned sat
[2023-03-08 21:56:36] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 876 ms returned sat
[2023-03-08 21:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:37] [INFO ] [Real]Absence check using state equation in 1471 ms returned sat
[2023-03-08 21:56:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:38] [INFO ] [Nat]Absence check using 59 positive place invariants in 52 ms returned sat
[2023-03-08 21:56:38] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 921 ms returned sat
[2023-03-08 21:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:40] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2023-03-08 21:56:40] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 175 ms.
[2023-03-08 21:56:41] [INFO ] Added : 20 causal constraints over 4 iterations in 954 ms. Result :sat
[2023-03-08 21:56:42] [INFO ] [Real]Absence check using 59 positive place invariants in 55 ms returned sat
[2023-03-08 21:56:42] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 655 ms returned sat
[2023-03-08 21:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:44] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2023-03-08 21:56:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:44] [INFO ] [Nat]Absence check using 59 positive place invariants in 56 ms returned sat
[2023-03-08 21:56:45] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 709 ms returned sat
[2023-03-08 21:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:47] [INFO ] [Nat]Absence check using state equation in 1537 ms returned sat
[2023-03-08 21:56:47] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 187 ms.
[2023-03-08 21:56:48] [INFO ] Added : 31 causal constraints over 7 iterations in 1447 ms. Result :sat
[2023-03-08 21:56:49] [INFO ] [Real]Absence check using 59 positive place invariants in 52 ms returned sat
[2023-03-08 21:56:49] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 190 ms returned sat
[2023-03-08 21:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:50] [INFO ] [Real]Absence check using state equation in 1421 ms returned sat
[2023-03-08 21:56:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:51] [INFO ] [Nat]Absence check using 59 positive place invariants in 56 ms returned sat
[2023-03-08 21:56:51] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 191 ms returned sat
[2023-03-08 21:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:52] [INFO ] [Nat]Absence check using state equation in 1414 ms returned sat
[2023-03-08 21:56:53] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 173 ms.
[2023-03-08 21:56:53] [INFO ] Added : 0 causal constraints over 0 iterations in 424 ms. Result :sat
[2023-03-08 21:56:53] [INFO ] [Real]Absence check using 59 positive place invariants in 49 ms returned sat
[2023-03-08 21:56:54] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 908 ms returned sat
[2023-03-08 21:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:56] [INFO ] [Real]Absence check using state equation in 1508 ms returned sat
[2023-03-08 21:56:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:56:56] [INFO ] [Nat]Absence check using 59 positive place invariants in 53 ms returned sat
[2023-03-08 21:56:57] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 922 ms returned sat
[2023-03-08 21:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:56:59] [INFO ] [Nat]Absence check using state equation in 1517 ms returned sat
[2023-03-08 21:56:59] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 166 ms.
[2023-03-08 21:57:00] [INFO ] Added : 20 causal constraints over 4 iterations in 926 ms. Result :sat
[2023-03-08 21:57:00] [INFO ] [Real]Absence check using 59 positive place invariants in 57 ms returned sat
[2023-03-08 21:57:00] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 204 ms returned sat
[2023-03-08 21:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:02] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2023-03-08 21:57:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:02] [INFO ] [Nat]Absence check using 59 positive place invariants in 53 ms returned sat
[2023-03-08 21:57:02] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 198 ms returned sat
[2023-03-08 21:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:04] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2023-03-08 21:57:04] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 168 ms.
[2023-03-08 21:57:04] [INFO ] Added : 0 causal constraints over 0 iterations in 428 ms. Result :sat
[2023-03-08 21:57:05] [INFO ] [Real]Absence check using 59 positive place invariants in 51 ms returned sat
[2023-03-08 21:57:05] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 213 ms returned sat
[2023-03-08 21:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:07] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2023-03-08 21:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:07] [INFO ] [Nat]Absence check using 59 positive place invariants in 54 ms returned sat
[2023-03-08 21:57:07] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 204 ms returned sat
[2023-03-08 21:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:09] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2023-03-08 21:57:09] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 154 ms.
[2023-03-08 21:57:10] [INFO ] Added : 19 causal constraints over 4 iterations in 920 ms. Result :sat
[2023-03-08 21:57:10] [INFO ] [Real]Absence check using 59 positive place invariants in 49 ms returned sat
[2023-03-08 21:57:11] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 895 ms returned sat
[2023-03-08 21:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:13] [INFO ] [Real]Absence check using state equation in 1501 ms returned sat
[2023-03-08 21:57:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:13] [INFO ] [Nat]Absence check using 59 positive place invariants in 51 ms returned sat
[2023-03-08 21:57:14] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 907 ms returned sat
[2023-03-08 21:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:16] [INFO ] [Nat]Absence check using state equation in 1553 ms returned sat
[2023-03-08 21:57:16] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 151 ms.
[2023-03-08 21:57:17] [INFO ] Added : 20 causal constraints over 4 iterations in 897 ms. Result :sat
[2023-03-08 21:57:17] [INFO ] [Real]Absence check using 59 positive place invariants in 49 ms returned sat
[2023-03-08 21:57:17] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 334 ms returned sat
[2023-03-08 21:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:19] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2023-03-08 21:57:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 51 ms returned sat
[2023-03-08 21:57:20] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 324 ms returned sat
[2023-03-08 21:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:21] [INFO ] [Nat]Absence check using state equation in 1624 ms returned sat
[2023-03-08 21:57:22] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 151 ms.
[2023-03-08 21:57:27] [INFO ] Deduced a trap composed of 37 places in 3174 ms of which 16 ms to minimize.
[2023-03-08 21:57:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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-08 21:57:28] [INFO ] [Real]Absence check using 59 positive place invariants in 50 ms returned sat
[2023-03-08 21:57:28] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 750 ms returned sat
[2023-03-08 21:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:30] [INFO ] [Real]Absence check using state equation in 1896 ms returned sat
[2023-03-08 21:57:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:31] [INFO ] [Nat]Absence check using 59 positive place invariants in 51 ms returned sat
[2023-03-08 21:57:31] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 804 ms returned sat
[2023-03-08 21:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:33] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2023-03-08 21:57:34] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 157 ms.
[2023-03-08 21:57:38] [INFO ] Deduced a trap composed of 37 places in 3021 ms of which 9 ms to minimize.
[2023-03-08 21:57:38] [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 9
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-08 21:57:39] [INFO ] [Real]Absence check using 59 positive place invariants in 48 ms returned sat
[2023-03-08 21:57:39] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 197 ms returned sat
[2023-03-08 21:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:40] [INFO ] [Real]Absence check using state equation in 1374 ms returned sat
[2023-03-08 21:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:41] [INFO ] [Nat]Absence check using 59 positive place invariants in 51 ms returned sat
[2023-03-08 21:57:41] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 196 ms returned sat
[2023-03-08 21:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:42] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2023-03-08 21:57:43] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 173 ms.
[2023-03-08 21:57:43] [INFO ] Added : 19 causal constraints over 4 iterations in 924 ms. Result :sat
[2023-03-08 21:57:44] [INFO ] [Real]Absence check using 59 positive place invariants in 48 ms returned sat
[2023-03-08 21:57:45] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 896 ms returned sat
[2023-03-08 21:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:46] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-08 21:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:47] [INFO ] [Nat]Absence check using 59 positive place invariants in 48 ms returned sat
[2023-03-08 21:57:48] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 877 ms returned sat
[2023-03-08 21:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:49] [INFO ] [Nat]Absence check using state equation in 1460 ms returned sat
[2023-03-08 21:57:49] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 161 ms.
[2023-03-08 21:57:50] [INFO ] Added : 20 causal constraints over 4 iterations in 910 ms. Result :sat
[2023-03-08 21:57:51] [INFO ] [Real]Absence check using 59 positive place invariants in 48 ms returned sat
[2023-03-08 21:57:51] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 727 ms returned sat
[2023-03-08 21:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:53] [INFO ] [Real]Absence check using state equation in 1825 ms returned sat
[2023-03-08 21:57:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:57:54] [INFO ] [Nat]Absence check using 59 positive place invariants in 48 ms returned sat
[2023-03-08 21:57:54] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 792 ms returned sat
[2023-03-08 21:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:57:56] [INFO ] [Nat]Absence check using state equation in 1715 ms returned sat
[2023-03-08 21:57:56] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 154 ms.
[2023-03-08 21:58:01] [INFO ] Deduced a trap composed of 37 places in 3067 ms of which 4 ms to minimize.
[2023-03-08 21:58:01] [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 12
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) : [380, 380, 380, 20, 380, 20, 20, 380, 380, 380, 20, 380, 380] Max seen :[131, 131, 219, 19, 131, 19, 10, 131, 26, 268, 10, 131, 268]
FORMULA DatabaseWithMutex-COL-20-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2000 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Free-agglomeration rule applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Applied a total of 800 rules in 443 ms. Remains 2860 /3260 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 2860/3260 places, 2800/3200 transitions.
// Phase 1: matrix 2800 rows 2860 cols
[2023-03-08 21:58:08] [INFO ] Computed 460 place invariants in 65 ms
Finished random walk after 236018 steps, including 0 resets, run visited all 11 properties in 30001 ms. (steps per millisecond=7 )
Finished Best-First random walk after 238724 steps, including 0 resets, run visited all 11 properties in 5003 ms. (steps per millisecond=47 )
FORMULA DatabaseWithMutex-COL-20-UpperBounds-14 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-10 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-06 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-01 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-00 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 621109 steps, including 1 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=124 )
FORMULA DatabaseWithMutex-COL-20-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 234535 steps, including 0 resets, run visited all 4 properties in 5001 ms. (steps per millisecond=46 )
FORMULA DatabaseWithMutex-COL-20-UpperBounds-15 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-12 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-08 21:58:53] [INFO ] Invariant cache hit.
[2023-03-08 21:58:53] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2023-03-08 21:58:54] [INFO ] [Real]Absence check using 58 positive and 402 generalized place invariants in 590 ms returned sat
[2023-03-08 21:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:58:56] [INFO ] [Real]Absence check using state equation in 2477 ms returned sat
[2023-03-08 21:58:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:58:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 36 ms returned sat
[2023-03-08 21:58:57] [INFO ] [Nat]Absence check using 58 positive and 402 generalized place invariants in 759 ms returned sat
[2023-03-08 21:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:58:59] [INFO ] [Nat]Absence check using state equation in 1655 ms returned sat
[2023-03-08 21:58:59] [INFO ] Computed and/alt/rep : 1600/1600/1600 causal constraints (skipped 800 transitions) in 133 ms.
[2023-03-08 21:59:00] [INFO ] Added : 17 causal constraints over 4 iterations in 780 ms. Result :sat
Minimization took 10473 ms.
[2023-03-08 21:59:11] [INFO ] [Real]Absence check using 58 positive place invariants in 37 ms returned sat
[2023-03-08 21:59:11] [INFO ] [Real]Absence check using 58 positive and 402 generalized place invariants in 122 ms returned sat
[2023-03-08 21:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:59:12] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2023-03-08 21:59:13] [INFO ] Computed and/alt/rep : 1600/1600/1600 causal constraints (skipped 800 transitions) in 140 ms.
[2023-03-08 21:59:17] [INFO ] Added : 153 causal constraints over 31 iterations in 4343 ms. Result :sat
Minimization took 2476 ms.
[2023-03-08 21:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:59:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 37 ms returned sat
[2023-03-08 21:59:20] [INFO ] [Nat]Absence check using 58 positive and 402 generalized place invariants in 122 ms returned sat
[2023-03-08 21:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:59:21] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2023-03-08 21:59:22] [INFO ] Computed and/alt/rep : 1600/1600/1600 causal constraints (skipped 800 transitions) in 136 ms.
[2023-03-08 21:59:25] [INFO ] Added : 150 causal constraints over 30 iterations in 3851 ms. Result :sat
Minimization took 2557 ms.
Current structural bounds on expressions (after SMT) : [380, 380] Max seen :[288, 32]
Support contains 800 out of 2860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 2800/2800 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 2860 transition count 2400
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2460 transition count 2400
Applied a total of 800 rules in 271 ms. Remains 2460 /2860 variables (removed 400) and now considering 2400/2800 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 2460/2860 places, 2400/2800 transitions.
// Phase 1: matrix 2400 rows 2460 cols
[2023-03-08 21:59:35] [INFO ] Computed 460 place invariants in 38 ms
Finished random walk after 927189 steps, including 2 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=30 )
Finished Best-First random walk after 291841 steps, including 0 resets, run visited all 2 properties in 5003 ms. (steps per millisecond=58 )
FORMULA DatabaseWithMutex-COL-20-UpperBounds-02 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-08 22:00:10] [INFO ] Invariant cache hit.
[2023-03-08 22:00:11] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-08 22:00:11] [INFO ] [Real]Absence check using 58 positive and 402 generalized place invariants in 201 ms returned sat
[2023-03-08 22:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:00:12] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2023-03-08 22:00:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:00:12] [INFO ] [Nat]Absence check using 58 positive place invariants in 30 ms returned sat
[2023-03-08 22:00:13] [INFO ] [Nat]Absence check using 58 positive and 402 generalized place invariants in 223 ms returned sat
[2023-03-08 22:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:00:14] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2023-03-08 22:00:14] [INFO ] Computed and/alt/rep : 1200/1200/1200 causal constraints (skipped 800 transitions) in 117 ms.
[2023-03-08 22:00:27] [INFO ] Added : 604 causal constraints over 121 iterations in 13423 ms. Result :sat
Minimization took 11220 ms.
Current structural bounds on expressions (after SMT) : [380] Max seen :[298]
Support contains 400 out of 2460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2400/2400 transitions.
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 400 Pre rules applied. Total rules applied 0 place count 2460 transition count 2000
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 0 with 800 rules applied. Total rules applied 800 place count 2060 transition count 2000
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 1200 place count 2060 transition count 1600
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 0 with 420 rules applied. Total rules applied 1620 place count 1640 transition count 1600
Applied a total of 1620 rules in 286 ms. Remains 1640 /2460 variables (removed 820) and now considering 1600/2400 (removed 800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 1640/2460 places, 1600/2400 transitions.
// Phase 1: matrix 1600 rows 1640 cols
[2023-03-08 22:00:39] [INFO ] Computed 440 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 27045 ms. (steps per millisecond=36 ) properties (out of 1) seen :141
Finished Best-First random walk after 329942 steps, including 0 resets, run visited all 1 properties in 5002 ms. (steps per millisecond=65 )
FORMULA DatabaseWithMutex-COL-20-UpperBounds-11 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 287888 ms.
ITS solved all properties within timeout

BK_STOP 1678312872185

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-COL-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DatabaseWithMutex-COL-20, 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 r103-tall-167814479101045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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