MCC'2023- Execution of r171-tall-167838858400309

About the Execution of Smart+red for FamilyReunion-COL-L00020M0002C001P001G001

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
577.172	130641.00	153058.00	445.50	21 21 2 21 21 21 2 21 21 21 21 21 21 21 21 21	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.r171-tall-167838858400309.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858400309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Feb 26 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 11:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 11:36 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 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 135K 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 FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679436183952

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00020M0002C001P001G001
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 22:03:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:03:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:03:05] [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-21 22:03:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 22:03:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2023-03-21 22:03:06] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2023-03-21 22:03:06] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-21 22:03:06] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 4 ms.
[2023-03-21 22:03:06] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-21 22:03:06] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-21 22:03:06] [INFO ] Invariant cache hit.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-21 22:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-21 22:03:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:03:06] [INFO ] Added : 24 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:03:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:03:06] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:03:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-21 22:03:06] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 12 ms.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-21 22:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:03:07] [INFO ] Added : 59 causal constraints over 12 iterations in 76 ms. Result :sat
Minimization took 15 ms.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:03:07] [INFO ] Added : 40 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-21 22:03:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:03:07] [INFO ] Added : 44 causal constraints over 9 iterations in 60 ms. Result :sat
Minimization took 14 ms.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:03:07] [INFO ] Added : 45 causal constraints over 9 iterations in 54 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:03:07] [INFO ] Added : 64 causal constraints over 13 iterations in 83 ms. Result :sat
Minimization took 14 ms.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:03:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:03:08] [INFO ] Added : 37 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:03:08] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:03:08] [INFO ] Added : 28 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-21 22:03:08] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:03:08] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:03:08] [INFO ] Added : 44 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-21 22:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:03:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:03:08] [INFO ] Added : 17 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:03:09] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:03:09] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:03:09] [INFO ] Added : 34 causal constraints over 7 iterations in 40 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [21, 21, 6, 42, 42, 42, 2, 168, 21, 21, 21, 462, 21, 21, 420, 21]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2023-03-21 22:03:09] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 41 ms.
[2023-03-21 22:03:09] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 21 places in 20 ms
Reduce places removed 30 places and 0 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 16) seen :134
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :34
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :45
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-10 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-08 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :4
// Phase 1: matrix 2438 rows 3065 cols
[2023-03-21 22:03:09] [INFO ] Computed 747 place invariants in 152 ms
[2023-03-21 22:03:10] [INFO ] [Real]Absence check using 26 positive place invariants in 38 ms returned sat
[2023-03-21 22:03:10] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-21 22:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:11] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2023-03-21 22:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:11] [INFO ] [Nat]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-21 22:03:12] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-21 22:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:13] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2023-03-21 22:03:13] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 123 ms.
[2023-03-21 22:03:18] [INFO ] Deduced a trap composed of 61 places in 1924 ms of which 13 ms to minimize.
[2023-03-21 22:03:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-21 22:03:18] [INFO ] [Real]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:19] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 188 ms returned unsat
[2023-03-21 22:03:19] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:19] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-21 22:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:20] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2023-03-21 22:03:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-21 22:03:21] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 200 ms returned sat
[2023-03-21 22:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:22] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-21 22:03:22] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 181 ms.
[2023-03-21 22:03:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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-21 22:03:26] [INFO ] [Real]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-21 22:03:26] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-21 22:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:27] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2023-03-21 22:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:28] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:28] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 193 ms returned sat
[2023-03-21 22:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:29] [INFO ] [Nat]Absence check using state equation in 1179 ms returned sat
[2023-03-21 22:03:29] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 120 ms.
[2023-03-21 22:03:34] [INFO ] Deduced a trap composed of 61 places in 1893 ms of which 3 ms to minimize.
[2023-03-21 22:03:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:03:35] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:35] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 195 ms returned sat
[2023-03-21 22:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:36] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2023-03-21 22:03:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-21 22:03:36] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 193 ms returned sat
[2023-03-21 22:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:38] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2023-03-21 22:03:38] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 107 ms.
[2023-03-21 22:03:43] [INFO ] Deduced a trap composed of 61 places in 1787 ms of which 3 ms to minimize.
[2023-03-21 22:03:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-21 22:03:43] [INFO ] [Real]Absence check using 26 positive place invariants in 37 ms returned sat
[2023-03-21 22:03:43] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 200 ms returned sat
[2023-03-21 22:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:44] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2023-03-21 22:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:45] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 191 ms returned sat
[2023-03-21 22:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:46] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2023-03-21 22:03:47] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 116 ms.
[2023-03-21 22:03:52] [INFO ] Deduced a trap composed of 61 places in 1933 ms of which 3 ms to minimize.
[2023-03-21 22:03:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:03:52] [INFO ] [Real]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:52] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 198 ms returned sat
[2023-03-21 22:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:53] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2023-03-21 22:03:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:54] [INFO ] [Nat]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-21 22:03:54] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 195 ms returned sat
[2023-03-21 22:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:55] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2023-03-21 22:03:55] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 117 ms.
[2023-03-21 22:04:00] [INFO ] Deduced a trap composed of 61 places in 1878 ms of which 3 ms to minimize.
[2023-03-21 22:04:00] [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 6
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-21 22:04:01] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-21 22:04:01] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 204 ms returned sat
[2023-03-21 22:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:02] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2023-03-21 22:04:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:04:03] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 203 ms returned sat
[2023-03-21 22:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:04] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2023-03-21 22:04:04] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 129 ms.
[2023-03-21 22:04:09] [INFO ] Deduced a trap composed of 61 places in 1887 ms of which 6 ms to minimize.
[2023-03-21 22:04:09] [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 7
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-21 22:04:09] [INFO ] [Real]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-21 22:04:10] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 206 ms returned sat
[2023-03-21 22:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:11] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-21 22:04:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:11] [INFO ] [Nat]Absence check using 26 positive place invariants in 33 ms returned sat
[2023-03-21 22:04:11] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 200 ms returned sat
[2023-03-21 22:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:13] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2023-03-21 22:04:13] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 112 ms.
[2023-03-21 22:04:18] [INFO ] Deduced a trap composed of 61 places in 1885 ms of which 3 ms to minimize.
[2023-03-21 22:04:18] [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-21 22:04:18] [INFO ] [Real]Absence check using 26 positive place invariants in 34 ms returned sat
[2023-03-21 22:04:18] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 179 ms returned sat
[2023-03-21 22:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:19] [INFO ] [Real]Absence check using state equation in 1266 ms returned sat
[2023-03-21 22:04:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:20] [INFO ] [Nat]Absence check using 26 positive place invariants in 44 ms returned sat
[2023-03-21 22:04:20] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 177 ms returned sat
[2023-03-21 22:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:21] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-21 22:04:21] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 124 ms.
[2023-03-21 22:04:27] [INFO ] Deduced a trap composed of 61 places in 1895 ms of which 3 ms to minimize.
[2023-03-21 22:04: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 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-21 22:04:27] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-21 22:04:27] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 199 ms returned sat
[2023-03-21 22:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:28] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2023-03-21 22:04:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:29] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-21 22:04:29] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 202 ms returned sat
[2023-03-21 22:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:30] [INFO ] [Nat]Absence check using state equation in 1230 ms returned sat
[2023-03-21 22:04:30] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 118 ms.
[2023-03-21 22:04:33] [INFO ] Added : 140 causal constraints over 28 iterations in 3155 ms. Result :unknown
[2023-03-21 22:04:34] [INFO ] [Real]Absence check using 26 positive place invariants in 30 ms returned sat
[2023-03-21 22:04:34] [INFO ] [Real]Absence check using 26 positive and 721 generalized place invariants in 198 ms returned sat
[2023-03-21 22:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:35] [INFO ] [Real]Absence check using state equation in 1455 ms returned sat
[2023-03-21 22:04:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2023-03-21 22:04:36] [INFO ] [Nat]Absence check using 26 positive and 721 generalized place invariants in 196 ms returned sat
[2023-03-21 22:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:37] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2023-03-21 22:04:37] [INFO ] Computed and/alt/rep : 2268/3234/2268 causal constraints (skipped 149 transitions) in 126 ms.
[2023-03-21 22:04:42] [INFO ] Deduced a trap composed of 61 places in 1964 ms of which 3 ms to minimize.
[2023-03-21 22:04:42] [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 11
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) : [21, 2, 42, 42, 42, 168, 21, 462, 21, 21, 420, 21] Max seen :[5, 2, 7, 10, 8, 16, 6, 8, 5, 13, 7, 4]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 318 out of 3065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Graph (complete) has 4456 edges and 3065 vertex of which 2483 are kept as prefixes of interest. Removing 582 places using SCC suffix rule.7 ms
Discarding 582 places :
Also discarding 443 output transitions
Drop transitions removed 443 transitions
Discarding 420 places :
Implicit places reduction removed 420 places
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 2063 transition count 1449
Reduce places removed 546 places and 0 transitions.
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Iterating post reduction 1 with 735 rules applied. Total rules applied 1702 place count 1517 transition count 1260
Reduce places removed 189 places and 0 transitions.
Iterating post reduction 2 with 189 rules applied. Total rules applied 1891 place count 1328 transition count 1260
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 1891 place count 1328 transition count 1113
Deduced a syphon composed of 147 places in 2 ms
Ensure Unique test removed 42 places
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 2227 place count 1139 transition count 1113
Discarding 126 places :
Symmetric choice reduction at 3 with 126 rule applications. Total rules 2353 place count 1013 transition count 987
Iterating global reduction 3 with 126 rules applied. Total rules applied 2479 place count 1013 transition count 987
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2479 place count 1013 transition count 966
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2521 place count 992 transition count 966
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2522 place count 991 transition count 945
Iterating global reduction 3 with 1 rules applied. Total rules applied 2523 place count 991 transition count 945
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2649 place count 928 transition count 882
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 3 with 84 rules applied. Total rules applied 2733 place count 928 transition count 798
Ensure Unique test removed 21 places
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 3 with 105 rules applied. Total rules applied 2838 place count 823 transition count 798
Applied a total of 2838 rules in 397 ms. Remains 823 /3065 variables (removed 2242) and now considering 798/2438 (removed 1640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 823/3065 places, 798/2438 transitions.
// Phase 1: matrix 798 rows 823 cols
[2023-03-21 22:04:43] [INFO ] Computed 128 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2262 resets, run finished after 6376 ms. (steps per millisecond=156 ) properties (out of 11) seen :133
Incomplete Best-First random walk after 1000001 steps, including 128 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 11) seen :64
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 93 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 10) seen :121
Incomplete Best-First random walk after 1000001 steps, including 93 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties (out of 10) seen :124
Incomplete Best-First random walk after 1000001 steps, including 112 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 10) seen :67
Incomplete Best-First random walk after 1000001 steps, including 87 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 10) seen :59
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 91 resets, run finished after 1185 ms. (steps per millisecond=843 ) properties (out of 9) seen :126
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-12 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 146 resets, run finished after 1308 ms. (steps per millisecond=764 ) properties (out of 8) seen :42
Incomplete Best-First random walk after 1000001 steps, including 113 resets, run finished after 1353 ms. (steps per millisecond=739 ) properties (out of 8) seen :81
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 22:04:59] [INFO ] Invariant cache hit.
[2023-03-21 22:04:59] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-21 22:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:59] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-21 22:04:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:04:59] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-21 22:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:04:59] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-21 22:05:00] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 41 ms.
[2023-03-21 22:05:02] [INFO ] Added : 254 causal constraints over 51 iterations in 2526 ms. Result :sat
Minimization took 433 ms.
[2023-03-21 22:05:03] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-21 22:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:03] [INFO ] [Real]Absence check using state equation in 268 ms returned unsat
[2023-03-21 22:05:03] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 24 ms returned sat
[2023-03-21 22:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:03] [INFO ] [Real]Absence check using state equation in 317 ms returned unsat
[2023-03-21 22:05:03] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-21 22:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:04] [INFO ] [Real]Absence check using state equation in 214 ms returned unsat
[2023-03-21 22:05:04] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-21 22:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:04] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-21 22:05:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:05:04] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 21 ms returned sat
[2023-03-21 22:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:04] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-21 22:05:04] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 38 ms.
[2023-03-21 22:05:05] [INFO ] Added : 36 causal constraints over 8 iterations in 394 ms. Result :sat
Minimization took 106 ms.
[2023-03-21 22:05:05] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 22 ms returned sat
[2023-03-21 22:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:05] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-21 22:05:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:05:05] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-21 22:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:06] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-03-21 22:05:06] [INFO ] Computed and/alt/rep : 651/1071/651 causal constraints (skipped 84 transitions) in 40 ms.
[2023-03-21 22:05:07] [INFO ] Added : 129 causal constraints over 26 iterations in 1070 ms. Result :sat
Minimization took 174 ms.
[2023-03-21 22:05:07] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 23 ms returned sat
[2023-03-21 22:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:07] [INFO ] [Real]Absence check using state equation in 136 ms returned unsat
Current structural bounds on expressions (after SMT) : [42, 21, 21, 21, 462, 21, 21] Max seen :[11, 21, 21, 21, 17, 13, 21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-14 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-13 21 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 84 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 798/798 transitions.
Graph (complete) has 1197 edges and 823 vertex of which 655 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.1 ms
Discarding 168 places :
Also discarding 105 output transitions
Drop transitions removed 105 transitions
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 211 place count 655 transition count 483
Reduce places removed 210 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 273 rules applied. Total rules applied 484 place count 445 transition count 420
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 547 place count 382 transition count 420
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 547 place count 382 transition count 378
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 631 place count 340 transition count 378
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 654 place count 317 transition count 315
Iterating global reduction 3 with 23 rules applied. Total rules applied 677 place count 317 transition count 315
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 63 rules applied. Total rules applied 740 place count 296 transition count 273
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 761 place count 275 transition count 273
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 782 place count 275 transition count 252
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 824 place count 233 transition count 252
Applied a total of 824 rules in 37 ms. Remains 233 /823 variables (removed 590) and now considering 252/798 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 233/823 places, 252/798 transitions.
// Phase 1: matrix 252 rows 233 cols
[2023-03-21 22:05:07] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 7874 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties (out of 2) seen :29
Incomplete Best-First random walk after 1000001 steps, including 315 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 2) seen :35
Incomplete Best-First random walk after 1000001 steps, including 355 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties (out of 2) seen :22
[2023-03-21 22:05:13] [INFO ] Invariant cache hit.
[2023-03-21 22:05:13] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-21 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:13] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2023-03-21 22:05:13] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-21 22:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:05:13] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21] Max seen :[21, 21]
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 128310 ms.
ITS solved all properties within timeout

BK_STOP 1679436314593

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, 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 r171-tall-167838858400309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 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 ;