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.r170-tall-167838857000301.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857000301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 12:04 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 134K 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-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678500663046

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 02:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 02:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:11:04] [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-11 02:11:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 02:11:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 653 ms
[2023-03-11 02:11:05] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2023-03-11 02:11:05] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-11 02:11:05] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 4 ms.
[2023-03-11 02:11:05] [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-11 02:11:05] [INFO ] Computed 33 place invariants in 10 ms
[2023-03-11 02:11:05] [INFO ] Invariant cache hit.
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-11 02:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 02:11:05] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-11 02:11:05] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 02:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 02:11:05] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:05] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 02:11:05] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-11 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-11 02:11:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 02:11:06] [INFO ] Added : 64 causal constraints over 13 iterations in 95 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:11:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:06] [INFO ] Added : 55 causal constraints over 11 iterations in 87 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 02:11:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:06] [INFO ] Added : 22 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:06] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 02:11:06] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 02:11:06] [INFO ] Added : 65 causal constraints over 13 iterations in 90 ms. Result :sat
Minimization took 16 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 02:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 02:11:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 02:11:07] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-11 02:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 02:11:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:07] [INFO ] Added : 58 causal constraints over 12 iterations in 76 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 02:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-11 02:11:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:07] [INFO ] Added : 55 causal constraints over 11 iterations in 70 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 02:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-11 02:11:07] [INFO ] Added : 32 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 02:11:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:11:07] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 02:11:07] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:08] [INFO ] Added : 61 causal constraints over 13 iterations in 73 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 02:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 02:11:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:08] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-11 02:11:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 02:11:08] [INFO ] Added : 38 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 02:11:08] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 02:11:08] [INFO ] Added : 28 causal constraints over 6 iterations in 36 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [66, 11, 2, 33, 11, 11, 2, 242, 2, 11, 11, 11, 2, 11, 22, 11]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
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
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2023-03-11 02:11:08] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 33 ms.
[2023-03-11 02:11:08] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 12 ms
Reduce places removed 19 places and 0 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :81
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 11 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :46
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :28
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :28
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :25
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :11
// Phase 1: matrix 1069 rows 1360 cols
[2023-03-11 02:11:09] [INFO ] Computed 331 place invariants in 77 ms
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 126 ms returned unsat
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 53 ms returned unsat
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-11 02:11:09] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 63 ms returned sat
[2023-03-11 02:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:10] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2023-03-11 02:11:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-11 02:11:10] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 64 ms returned sat
[2023-03-11 02:11:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:10] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-11 02:11:11] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 71 ms.
[2023-03-11 02:11:15] [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-11 02:11:15] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-11 02:11:15] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 66 ms returned unsat
[2023-03-11 02:11:15] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-11 02:11:15] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 66 ms returned sat
[2023-03-11 02:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:16] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-11 02:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-11 02:11:16] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 67 ms returned sat
[2023-03-11 02:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:16] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-11 02:11:16] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 49 ms.
[2023-03-11 02:11:21] [INFO ] Deduced a trap composed of 27 places in 514 ms of which 7 ms to minimize.
[2023-03-11 02:11:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-11 02:11:21] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-11 02:11:21] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 62 ms returned sat
[2023-03-11 02:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:22] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-11 02:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-11 02:11:22] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 64 ms returned sat
[2023-03-11 02:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:23] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-11 02:11:23] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 53 ms.
[2023-03-11 02:11:27] [INFO ] Added : 355 causal constraints over 71 iterations in 4343 ms. Result :unknown
[2023-03-11 02:11:27] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-11 02:11:27] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 63 ms returned sat
[2023-03-11 02:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:28] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-11 02:11:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-11 02:11:28] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 66 ms returned sat
[2023-03-11 02:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:28] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-11 02:11:28] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 57 ms.
[2023-03-11 02:11:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
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-11 02:11:33] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-11 02:11:33] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 61 ms returned sat
[2023-03-11 02:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:33] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-11 02:11:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-11 02:11:33] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 64 ms returned sat
[2023-03-11 02:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:34] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-11 02:11:34] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 60 ms.
[2023-03-11 02:11:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-11 02:11:38] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2023-03-11 02:11:39] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 67 ms returned sat
[2023-03-11 02:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:39] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-11 02:11:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:39] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-11 02:11:39] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 62 ms returned sat
[2023-03-11 02:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:40] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-11 02:11:40] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 51 ms.
[2023-03-11 02:11:44] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 2 ms to minimize.
[2023-03-11 02:11:44] [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)
Current structural bounds on expressions (after SMT) : [11, 11, 2, 11, 11, 11, 2, 22, 11] Max seen :[11, 11, 1, 11, 9, 5, 1, 3, 4]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 77 out of 1360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Graph (complete) has 1951 edges and 1360 vertex of which 1305 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.3 ms
Discarding 55 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 187 places :
Implicit places reduction removed 187 places
Drop transitions removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 682 rules applied. Total rules applied 683 place count 1118 transition count 561
Reduce places removed 484 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 528 rules applied. Total rules applied 1211 place count 634 transition count 517
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 1255 place count 590 transition count 517
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1255 place count 590 transition count 396
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 1530 place count 436 transition count 396
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 44 rules applied. Total rules applied 1574 place count 403 transition count 385
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1585 place count 392 transition count 385
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1585 place count 392 transition count 374
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1607 place count 381 transition count 374
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1651 place count 337 transition count 330
Iterating global reduction 5 with 44 rules applied. Total rules applied 1695 place count 337 transition count 330
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 11 rules applied. Total rules applied 1706 place count 337 transition count 319
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1717 place count 326 transition count 319
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1717 place count 326 transition count 308
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1739 place count 315 transition count 308
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1741 place count 313 transition count 286
Iterating global reduction 7 with 2 rules applied. Total rules applied 1743 place count 313 transition count 286
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 33 rules applied. Total rules applied 1776 place count 291 transition count 275
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1787 place count 280 transition count 275
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1787 place count 280 transition count 264
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1809 place count 269 transition count 264
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1820 place count 258 transition count 253
Iterating global reduction 9 with 11 rules applied. Total rules applied 1831 place count 258 transition count 253
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 9 with 44 rules applied. Total rules applied 1875 place count 247 transition count 220
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1897 place count 225 transition count 220
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1919 place count 214 transition count 209
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 11 with 22 rules applied. Total rules applied 1941 place count 214 transition count 187
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 11 with 22 rules applied. Total rules applied 1963 place count 192 transition count 187
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1974 place count 181 transition count 176
Applied a total of 1974 rules in 140 ms. Remains 181 /1360 variables (removed 1179) and now considering 176/1069 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 181/1360 places, 176/1069 transitions.
// Phase 1: matrix 176 rows 181 cols
[2023-03-11 02:11:45] [INFO ] Computed 16 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 10417 resets, run finished after 2711 ms. (steps per millisecond=368 ) properties (out of 6) seen :41
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 840 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 4) seen :38
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 956 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 789 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 3) seen :13
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 02:11:50] [INFO ] Invariant cache hit.
[2023-03-11 02:11:50] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:50] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-11 02:11:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:11:50] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-11 02:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:50] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-11 02:11:50] [INFO ] Computed and/alt/rep : 132/165/132 causal constraints (skipped 33 transitions) in 8 ms.
[2023-03-11 02:11:50] [INFO ] Added : 21 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 27 ms.
[2023-03-11 02:11:50] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-11 02:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:11:50] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [11, 11] Max seen :[9, 11]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 45838 ms.
ITS solved all properties within timeout

BK_STOP 1678500721267

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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