fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
983.607 303551.00 341825.00 820.50 51 51 2 51 51 51 51 51 51 51 51 51 51 2 51 51 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-167838858400317.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-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858400317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.2K Feb 26 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:26 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 137K 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-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679437067849

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-L00050M0005C002P002G001
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 22:17:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:17:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:17:49] [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:17:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 22:17:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 676 ms
[2023-03-21 22:17:50] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2023-03-21 22:17:50] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-21 22:17:50] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-21 22:17:50] [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:17:50] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-21 22:17:50] [INFO ] Invariant cache hit.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-21 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-21 22:17:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-21 22:17:50] [INFO ] Added : 13 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 9 ms.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-21 22:17:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:17:50] [INFO ] Added : 37 causal constraints over 8 iterations in 65 ms. Result :sat
Minimization took 14 ms.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:17:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:50] [INFO ] Added : 60 causal constraints over 12 iterations in 79 ms. Result :sat
Minimization took 15 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-21 22:17:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:51] [INFO ] Added : 49 causal constraints over 10 iterations in 66 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:17:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-21 22:17:51] [INFO ] Added : 40 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:51] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:17:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:51] [INFO ] Added : 53 causal constraints over 11 iterations in 65 ms. Result :sat
Minimization took 12 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:17:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:17:51] [INFO ] Added : 24 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:52] [INFO ] Added : 23 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-21 22:17:52] [INFO ] Added : 32 causal constraints over 7 iterations in 39 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:52] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:52] [INFO ] Added : 38 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 11 ms.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:52] [INFO ] Added : 55 causal constraints over 11 iterations in 63 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:17:52] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:52] [INFO ] Added : 60 causal constraints over 12 iterations in 66 ms. Result :sat
Minimization took 14 ms.
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:53] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:17:53] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:17:53] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [51, 102, 6, 51, 102, 51, 120, 51, 255, 51, 51, 102, 51, 6, 51, 51]
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 :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 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
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 :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
[2023-03-21 22:17:53] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 82 ms.
[2023-03-21 22:17:53] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 51 places in 52 ms
Reduce places removed 64 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 16) seen :206
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :23
// Phase 1: matrix 9336 rows 11403 cols
[2023-03-21 22:17:55] [INFO ] Computed 2767 place invariants in 663 ms
[2023-03-21 22:17:56] [INFO ] [Real]Absence check using 59 positive place invariants in 188 ms returned sat
[2023-03-21 22:17:57] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1284 ms returned sat
[2023-03-21 22:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:00] [INFO ] [Real]Absence check using state equation in 2451 ms returned unknown
[2023-03-21 22:18:01] [INFO ] [Real]Absence check using 59 positive place invariants in 178 ms returned sat
[2023-03-21 22:18:02] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1268 ms returned sat
[2023-03-21 22:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:05] [INFO ] [Real]Absence check using state equation in 2575 ms returned unknown
[2023-03-21 22:18:06] [INFO ] [Real]Absence check using 59 positive place invariants in 183 ms returned sat
[2023-03-21 22:18:07] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1203 ms returned sat
[2023-03-21 22:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:10] [INFO ] [Real]Absence check using state equation in 2493 ms returned unknown
[2023-03-21 22:18:11] [INFO ] [Real]Absence check using 59 positive place invariants in 185 ms returned sat
[2023-03-21 22:18:12] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1170 ms returned sat
[2023-03-21 22:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:15] [INFO ] [Real]Absence check using state equation in 2630 ms returned unknown
[2023-03-21 22:18:16] [INFO ] [Real]Absence check using 59 positive place invariants in 174 ms returned sat
[2023-03-21 22:18:17] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1288 ms returned sat
[2023-03-21 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:20] [INFO ] [Real]Absence check using state equation in 2455 ms returned unknown
[2023-03-21 22:18:21] [INFO ] [Real]Absence check using 59 positive place invariants in 195 ms returned sat
[2023-03-21 22:18:22] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1296 ms returned sat
[2023-03-21 22:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:25] [INFO ] [Real]Absence check using state equation in 2471 ms returned unknown
[2023-03-21 22:18:26] [INFO ] [Real]Absence check using 59 positive place invariants in 187 ms returned sat
[2023-03-21 22:18:27] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1253 ms returned sat
[2023-03-21 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:30] [INFO ] [Real]Absence check using state equation in 2600 ms returned unknown
[2023-03-21 22:18:31] [INFO ] [Real]Absence check using 59 positive place invariants in 195 ms returned sat
[2023-03-21 22:18:32] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1234 ms returned sat
[2023-03-21 22:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:35] [INFO ] [Real]Absence check using state equation in 2599 ms returned unknown
[2023-03-21 22:18:36] [INFO ] [Real]Absence check using 59 positive place invariants in 181 ms returned sat
[2023-03-21 22:18:37] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1264 ms returned sat
[2023-03-21 22:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:40] [INFO ] [Real]Absence check using state equation in 2457 ms returned unknown
[2023-03-21 22:18:41] [INFO ] [Real]Absence check using 59 positive place invariants in 184 ms returned sat
[2023-03-21 22:18:43] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1266 ms returned sat
[2023-03-21 22:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:45] [INFO ] [Real]Absence check using state equation in 2471 ms returned unknown
[2023-03-21 22:18:46] [INFO ] [Real]Absence check using 59 positive place invariants in 185 ms returned sat
[2023-03-21 22:18:47] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1320 ms returned sat
[2023-03-21 22:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:50] [INFO ] [Real]Absence check using state equation in 2529 ms returned unknown
[2023-03-21 22:18:51] [INFO ] [Real]Absence check using 59 positive place invariants in 190 ms returned sat
[2023-03-21 22:18:52] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1233 ms returned sat
[2023-03-21 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:55] [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 11
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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:18:56] [INFO ] [Real]Absence check using 59 positive place invariants in 179 ms returned sat
[2023-03-21 22:18:57] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1244 ms returned sat
[2023-03-21 22:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:19:00] [INFO ] [Real]Absence check using state equation in 2547 ms returned unknown
[2023-03-21 22:19:01] [INFO ] [Real]Absence check using 59 positive place invariants in 181 ms returned sat
[2023-03-21 22:19:02] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1172 ms returned unsat
[2023-03-21 22:19:04] [INFO ] [Real]Absence check using 59 positive place invariants in 179 ms returned sat
[2023-03-21 22:19:05] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1127 ms returned sat
[2023-03-21 22:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:19:07] [INFO ] [Real]Absence check using state equation in 2725 ms returned unknown
[2023-03-21 22:19:09] [INFO ] [Real]Absence check using 59 positive place invariants in 191 ms returned sat
[2023-03-21 22:19:10] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1306 ms returned sat
[2023-03-21 22:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:19:12] [INFO ] [Real]Absence check using state equation in 2506 ms returned unknown
Current structural bounds on expressions (after SMT) : [51, 102, 6, 51, 102, 51, 120, 51, 255, 51, 51, 102, 51, 2, 51, 51] Max seen :[10, 9, 1, 14, 9, 36, 7, 8, 22, 11, 31, 7, 7, 2, 9, 31]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1989 out of 11403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Graph (complete) has 16989 edges and 11403 vertex of which 10875 are kept as prefixes of interest. Removing 528 places using SCC suffix rule.24 ms
Discarding 528 places :
Also discarding 360 output transitions
Drop transitions removed 360 transitions
Discarding 1326 places :
Implicit places reduction removed 1326 places
Drop transitions removed 2193 transitions
Trivial Post-agglo rules discarded 2193 transitions
Performed 2193 trivial Post agglomeration. Transition count delta: 2193
Iterating post reduction 0 with 3519 rules applied. Total rules applied 3520 place count 9549 transition count 6783
Reduce places removed 2193 places and 0 transitions.
Performed 561 Post agglomeration using F-continuation condition.Transition count delta: 561
Iterating post reduction 1 with 2754 rules applied. Total rules applied 6274 place count 7356 transition count 6222
Reduce places removed 561 places and 0 transitions.
Iterating post reduction 2 with 561 rules applied. Total rules applied 6835 place count 6795 transition count 6222
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 6835 place count 6795 transition count 5355
Deduced a syphon composed of 867 places in 5 ms
Ensure Unique test removed 459 places
Reduce places removed 1326 places and 0 transitions.
Iterating global reduction 3 with 2193 rules applied. Total rules applied 9028 place count 5469 transition count 5355
Discarding 204 places :
Implicit places reduction removed 204 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 9232 place count 5265 transition count 5355
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 9232 place count 5265 transition count 5304
Deduced a syphon composed of 51 places in 22 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 9334 place count 5214 transition count 5304
Discarding 612 places :
Symmetric choice reduction at 4 with 612 rule applications. Total rules 9946 place count 4602 transition count 4692
Iterating global reduction 4 with 612 rules applied. Total rules applied 10558 place count 4602 transition count 4692
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 10565 place count 4595 transition count 4335
Iterating global reduction 4 with 7 rules applied. Total rules applied 10572 place count 4595 transition count 4335
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 10623 place count 4544 transition count 4335
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10623 place count 4544 transition count 4284
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 10725 place count 4493 transition count 4284
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 5 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 255 rules applied. Total rules applied 10980 place count 4340 transition count 4182
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 5 with 408 rules applied. Total rules applied 11388 place count 4340 transition count 3774
Ensure Unique test removed 357 places
Reduce places removed 765 places and 0 transitions.
Iterating post reduction 5 with 765 rules applied. Total rules applied 12153 place count 3575 transition count 3774
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 12204 place count 3524 transition count 3723
Applied a total of 12204 rules in 3111 ms. Remains 3524 /11403 variables (removed 7879) and now considering 3723/9336 (removed 5613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3127 ms. Remains : 3524/11403 places, 3723/9336 transitions.
// Phase 1: matrix 3723 rows 3524 cols
[2023-03-21 22:19:16] [INFO ] Computed 158 place invariants in 86 ms
Finished random walk after 908169 steps, including 708 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=30 )
Finished Best-First random walk after 933240 steps, including 18 resets, run visited all 15 properties in 5001 ms. (steps per millisecond=186 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2278 ms. (steps per millisecond=438 ) properties (out of 14) seen :235
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 2272 ms. (steps per millisecond=440 ) properties (out of 14) seen :245
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 854033 steps, including 16 resets, run visited all 13 properties in 5001 ms. (steps per millisecond=170 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 2337 ms. (steps per millisecond=427 ) properties (out of 12) seen :185
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 3522 ms. (steps per millisecond=283 ) properties (out of 11) seen :158
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 2111 ms. (steps per millisecond=473 ) properties (out of 10) seen :157
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 2142 ms. (steps per millisecond=466 ) properties (out of 10) seen :207
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 976401 steps, including 20 resets, run visited all 9 properties in 5001 ms. (steps per millisecond=195 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 22:20:15] [INFO ] Invariant cache hit.
[2023-03-21 22:20:16] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 87 ms returned sat
[2023-03-21 22:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:17] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2023-03-21 22:20:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:18] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 89 ms returned sat
[2023-03-21 22:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:20] [INFO ] [Nat]Absence check using state equation in 1664 ms returned sat
[2023-03-21 22:20:20] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 331 ms.
[2023-03-21 22:20:40] [INFO ] Added : 583 causal constraints over 117 iterations in 20198 ms. Result :sat
[2023-03-21 22:20:40] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 89 ms returned sat
[2023-03-21 22:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:41] [INFO ] [Real]Absence check using state equation in 1031 ms returned unsat
[2023-03-21 22:20:42] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 87 ms returned sat
[2023-03-21 22:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:44] [INFO ] [Real]Absence check using state equation in 1700 ms returned sat
[2023-03-21 22:20:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:44] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 89 ms returned sat
[2023-03-21 22:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:46] [INFO ] [Nat]Absence check using state equation in 1659 ms returned sat
[2023-03-21 22:20:46] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 227 ms.
[2023-03-21 22:21:06] [INFO ] Added : 590 causal constraints over 118 iterations in 20111 ms.(timeout) Result :sat
[2023-03-21 22:21:07] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 92 ms returned sat
[2023-03-21 22:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:08] [INFO ] [Real]Absence check using state equation in 1614 ms returned sat
[2023-03-21 22:21:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:09] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 87 ms returned sat
[2023-03-21 22:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:10] [INFO ] [Nat]Absence check using state equation in 1567 ms returned sat
[2023-03-21 22:21:11] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 381 ms.
[2023-03-21 22:21:30] [INFO ] Added : 600 causal constraints over 120 iterations in 20097 ms.(timeout) Result :sat
[2023-03-21 22:21:31] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 83 ms returned sat
[2023-03-21 22:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:32] [INFO ] [Real]Absence check using state equation in 823 ms returned unsat
[2023-03-21 22:21:32] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 84 ms returned sat
[2023-03-21 22:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:34] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2023-03-21 22:21:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:34] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 85 ms returned sat
[2023-03-21 22:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using state equation in 1492 ms returned sat
[2023-03-21 22:21:36] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 159 ms.
[2023-03-21 22:21:38] [INFO ] Added : 65 causal constraints over 13 iterations in 2305 ms. Result :sat
[2023-03-21 22:21:39] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 87 ms returned sat
[2023-03-21 22:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using state equation in 824 ms returned unsat
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 87 ms returned sat
[2023-03-21 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using state equation in 1596 ms returned sat
[2023-03-21 22:21:42] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 163 ms.
[2023-03-21 22:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:54] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 90 ms returned sat
[2023-03-21 22:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:56] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2023-03-21 22:21:56] [INFO ] Computed and/alt/rep : 3213/3927/3213 causal constraints (skipped 204 transitions) in 191 ms.
[2023-03-21 22:22:14] [INFO ] Added : 539 causal constraints over 108 iterations in 17703 ms. Result :sat
Current structural bounds on expressions (after SMT) : [102, 2, 102, 120, 51, 51, 51, 51] Max seen :[16, 2, 16, 15, 51, 45, 51, 19]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 612 out of 3524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3524/3524 places, 3723/3723 transitions.
Graph (complete) has 5101 edges and 3524 vertex of which 3267 are kept as prefixes of interest. Removing 257 places using SCC suffix rule.2 ms
Discarding 257 places :
Also discarding 255 output transitions
Drop transitions removed 255 transitions
Drop transitions removed 1428 transitions
Trivial Post-agglo rules discarded 1428 transitions
Performed 1428 trivial Post agglomeration. Transition count delta: 1428
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 3267 transition count 2040
Reduce places removed 1428 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 1530 rules applied. Total rules applied 2959 place count 1839 transition count 1938
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 3061 place count 1737 transition count 1938
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 255 Pre rules applied. Total rules applied 3061 place count 1737 transition count 1683
Deduced a syphon composed of 255 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 561 rules applied. Total rules applied 3622 place count 1431 transition count 1683
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3877 place count 1176 transition count 1428
Iterating global reduction 3 with 255 rules applied. Total rules applied 4132 place count 1176 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4234 place count 1125 transition count 1377
Applied a total of 4234 rules in 130 ms. Remains 1125 /3524 variables (removed 2399) and now considering 1377/3723 (removed 2346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 1125/3524 places, 1377/3723 transitions.
// Phase 1: matrix 1377 rows 1125 cols
[2023-03-21 22:22:18] [INFO ] Computed 105 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 1779 resets, run finished after 13406 ms. (steps per millisecond=74 ) properties (out of 5) seen :120
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 3377 ms. (steps per millisecond=296 ) properties (out of 5) seen :105
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 5) seen :127
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2064 ms. (steps per millisecond=484 ) properties (out of 5) seen :141
Finished Best-First random walk after 949892 steps, including 41 resets, run visited all 5 properties in 5001 ms. (steps per millisecond=189 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-21 22:22:44] [INFO ] Invariant cache hit.
[2023-03-21 22:22:44] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 30 ms returned sat
[2023-03-21 22:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:22:44] [INFO ] [Real]Absence check using state equation in 257 ms returned unsat
[2023-03-21 22:22:44] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 27 ms returned sat
[2023-03-21 22:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:22:45] [INFO ] [Real]Absence check using state equation in 380 ms returned unsat
[2023-03-21 22:22:45] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 27 ms returned sat
[2023-03-21 22:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:22:45] [INFO ] [Real]Absence check using state equation in 378 ms returned unsat
[2023-03-21 22:22:45] [INFO ] [Real]Absence check using 0 positive and 105 generalized place invariants in 28 ms returned sat
[2023-03-21 22:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:22:46] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-21 22:22:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:22:46] [INFO ] [Nat]Absence check using 0 positive and 105 generalized place invariants in 27 ms returned sat
[2023-03-21 22:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:22:46] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2023-03-21 22:22:46] [INFO ] Computed and/alt/rep : 918/1734/918 causal constraints (skipped 153 transitions) in 61 ms.
[2023-03-21 22:22:49] [INFO ] Added : 205 causal constraints over 41 iterations in 2806 ms. Result :sat
Minimization took 588 ms.
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51] Max seen :[51, 51, 51, 26]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 51 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 301125 ms.
ITS solved all properties within timeout

BK_STOP 1679437371400

--------------------
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-L00050M0005C002P002G001"
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-L00050M0005C002P002G001, 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-167838858400317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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