About the Execution of 2023-gold for FamilyReunion-COL-L00010M0001C001P001G001
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280200241.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r175-smll-171636280200241
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.4K Apr 11 20:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 20:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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 1716586716634
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-24 21:38:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:38:39] [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.
[2024-05-24 21:38:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 21:38:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1463 ms
[2024-05-24 21:38:41] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2024-05-24 21:38:41] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 58 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2024-05-24 21:38:41] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 11 ms.
[2024-05-24 21:38:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2024-05-24 21:38:41] [INFO ] Computed 33 invariants in 14 ms
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 21:38:41] [INFO ] Invariant cache hit.
[2024-05-24 21:38:41] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2024-05-24 21:38:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 26 ms returned sat
[2024-05-24 21:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:41] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-24 21:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-24 21:38:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-24 21:38:42] [INFO ] Added : 9 causal constraints over 2 iterations in 73 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-24 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-24 21:38:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-24 21:38:42] [INFO ] Added : 15 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 15 ms.
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:42] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-24 21:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-24 21:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-24 21:38:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 21:38:43] [INFO ] Added : 53 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 18 ms.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 21:38:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 21:38:43] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-24 21:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-24 21:38:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 21:38:43] [INFO ] Added : 43 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:43] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-24 21:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 21:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:43] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-24 21:38:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 21:38:43] [INFO ] Added : 45 causal constraints over 9 iterations in 100 ms. Result :sat
Minimization took 26 ms.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-24 21:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-24 21:38:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 21:38:44] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-24 21:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-24 21:38:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 21:38:44] [INFO ] Added : 12 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 21:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:44] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-24 21:38:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 21:38:44] [INFO ] Added : 49 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 28 ms.
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-24 21:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-24 21:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-24 21:38:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 21:38:45] [INFO ] Added : 28 causal constraints over 6 iterations in 81 ms. Result :sat
Minimization took 24 ms.
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 21:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-24 21:38:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 21:38:45] [INFO ] Added : 56 causal constraints over 12 iterations in 138 ms. Result :sat
Minimization took 29 ms.
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-24 21:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-24 21:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:45] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-24 21:38:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 21:38:45] [INFO ] Added : 17 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-24 21:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-24 21:38:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 21:38:46] [INFO ] Added : 48 causal constraints over 10 iterations in 106 ms. Result :sat
Minimization took 25 ms.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-24 21:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-24 21:38:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 21:38:46] [INFO ] Added : 27 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 21 ms.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-24 21:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-24 21:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:46] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-24 21:38:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-24 21:38:46] [INFO ] Added : 43 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [11, 11, 40, 11, 22, 11, 11, 220, 11, 11, 2, 11, 11, 11, 22]
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
[2024-05-24 21:38:47] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 72 ms.
[2024-05-24 21:38:47] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 29 ms
Reduce places removed 19 places and 0 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 15) seen :77
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :32
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :23
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 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :22
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :24
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :11
// Phase 1: matrix 1069 rows 1360 cols
[2024-05-24 21:38:47] [INFO ] Computed 331 invariants in 103 ms
[2024-05-24 21:38:48] [INFO ] [Real]Absence check using 31 positive place invariants in 48 ms returned sat
[2024-05-24 21:38:48] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 142 ms returned sat
[2024-05-24 21:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:48] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-05-24 21:38:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-24 21:38:49] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 139 ms returned sat
[2024-05-24 21:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:50] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2024-05-24 21:38:50] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 71 ms.
[2024-05-24 21:38:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:38:54] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-24 21:38:54] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 115 ms returned sat
[2024-05-24 21:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:55] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-24 21:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:38:55] [INFO ] [Nat]Absence check using 31 positive place invariants in 45 ms returned sat
[2024-05-24 21:38:55] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 154 ms returned sat
[2024-05-24 21:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:38:56] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-05-24 21:38:56] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 81 ms.
[2024-05-24 21:39:01] [INFO ] Deduced a trap composed of 27 places in 1180 ms of which 17 ms to minimize.
[2024-05-24 21:39:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:01] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-24 21:39:01] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 171 ms returned sat
[2024-05-24 21:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:02] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2024-05-24 21:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2024-05-24 21:39:03] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 104 ms returned sat
[2024-05-24 21:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:03] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2024-05-24 21:39:04] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 98 ms.
[2024-05-24 21:39:08] [INFO ] Deduced a trap composed of 27 places in 1220 ms of which 3 ms to minimize.
[2024-05-24 21:39:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:09] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2024-05-24 21:39:09] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 146 ms returned sat
[2024-05-24 21:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:10] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-05-24 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2024-05-24 21:39:10] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 108 ms returned sat
[2024-05-24 21:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:11] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2024-05-24 21:39:11] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 82 ms.
[2024-05-24 21:39:16] [INFO ] Deduced a trap composed of 27 places in 1528 ms of which 4 ms to minimize.
[2024-05-24 21:39:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:17] [INFO ] [Real]Absence check using 31 positive place invariants in 49 ms returned sat
[2024-05-24 21:39:17] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 185 ms returned sat
[2024-05-24 21:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:18] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2024-05-24 21:39:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 49 ms returned sat
[2024-05-24 21:39:18] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 179 ms returned sat
[2024-05-24 21:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:19] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2024-05-24 21:39:19] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 114 ms.
[2024-05-24 21:39:24] [INFO ] Deduced a trap composed of 27 places in 1529 ms of which 3 ms to minimize.
[2024-05-24 21:39:24] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:25] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2024-05-24 21:39:25] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 157 ms returned sat
[2024-05-24 21:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:26] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2024-05-24 21:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-24 21:39:26] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 109 ms returned sat
[2024-05-24 21:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:27] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-24 21:39:27] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 99 ms.
[2024-05-24 21:39:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:31] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2024-05-24 21:39:31] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 170 ms returned sat
[2024-05-24 21:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:32] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2024-05-24 21:39:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2024-05-24 21:39:32] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 152 ms returned sat
[2024-05-24 21:39:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:33] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2024-05-24 21:39:33] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 71 ms.
[2024-05-24 21:39:38] [INFO ] Deduced a trap composed of 27 places in 1413 ms of which 3 ms to minimize.
[2024-05-24 21:39: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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:39] [INFO ] [Real]Absence check using 31 positive place invariants in 34 ms returned sat
[2024-05-24 21:39:39] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 116 ms returned sat
[2024-05-24 21:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:40] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2024-05-24 21:39:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2024-05-24 21:39:40] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 105 ms returned sat
[2024-05-24 21:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:41] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2024-05-24 21:39:41] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 71 ms.
[2024-05-24 21:39:45] [INFO ] Added : 160 causal constraints over 32 iterations in 3776 ms. Result :unknown
[2024-05-24 21:39:45] [INFO ] [Real]Absence check using 31 positive place invariants in 45 ms returned sat
[2024-05-24 21:39:45] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 162 ms returned sat
[2024-05-24 21:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:46] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2024-05-24 21:39:46] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 58 ms.
[2024-05-24 21:39:51] [INFO ] Deduced a trap composed of 27 places in 1418 ms of which 2 ms to minimize.
[2024-05-24 21:39:51] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-24 21:39:52] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2024-05-24 21:39:52] [INFO ] [Real]Absence check using 31 positive and 300 generalized place invariants in 133 ms returned sat
[2024-05-24 21:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:52] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2024-05-24 21:39:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:39:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 44 ms returned sat
[2024-05-24 21:39:53] [INFO ] [Nat]Absence check using 31 positive and 300 generalized place invariants in 148 ms returned sat
[2024-05-24 21:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:39:54] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2024-05-24 21:39:54] [INFO ] Computed and/alt/rep : 990/1386/990 causal constraints (skipped 68 transitions) in 88 ms.
[2024-05-24 21:39:59] [INFO ] Deduced a trap composed of 27 places in 1142 ms of which 2 ms to minimize.
[2024-05-24 21:39:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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, 40, 22, 11, 220, 11, 11, 11, 11, 22] Max seen :[6, 3, 6, 6, 5, 6, 4, 4, 5, 3]
Support contains 121 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 1127 are kept as prefixes of interest. Removing 233 places using SCC suffix rule.8 ms
Discarding 233 places :
Also discarding 167 output transitions
Drop transitions removed 167 transitions
Discarding 154 places :
Implicit places reduction removed 154 places
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 506 rules applied. Total rules applied 507 place count 973 transition count 550
Reduce places removed 352 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 396 rules applied. Total rules applied 903 place count 621 transition count 506
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 947 place count 577 transition count 506
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 947 place count 577 transition count 440
Deduced a syphon composed of 66 places in 3 ms
Ensure Unique test removed 22 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 1101 place count 489 transition count 440
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1123 place count 489 transition count 418
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1145 place count 467 transition count 418
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 1189 place count 423 transition count 374
Iterating global reduction 5 with 44 rules applied. Total rules applied 1233 place count 423 transition count 374
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 1244 place count 423 transition count 363
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1255 place count 412 transition count 363
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1255 place count 412 transition count 341
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1299 place count 390 transition count 341
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1301 place count 388 transition count 319
Iterating global reduction 7 with 2 rules applied. Total rules applied 1303 place count 388 transition count 319
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 7 with 55 rules applied. Total rules applied 1358 place count 355 transition count 297
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1369 place count 344 transition count 297
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1369 place count 344 transition count 286
Deduced a syphon composed of 11 places in 10 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1391 place count 333 transition count 286
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 9 with 22 rules applied. Total rules applied 1413 place count 322 transition count 275
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 9 with 44 rules applied. Total rules applied 1457 place count 322 transition count 231
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 9 with 44 rules applied. Total rules applied 1501 place count 278 transition count 231
Applied a total of 1501 rules in 375 ms. Remains 278 /1360 variables (removed 1082) and now considering 231/1069 (removed 838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 278/1360 places, 231/1069 transitions.
// Phase 1: matrix 231 rows 278 cols
[2024-05-24 21:40:00] [INFO ] Computed 58 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 5025 resets, run finished after 3976 ms. (steps per millisecond=251 ) properties (out of 10) seen :87
Incomplete Best-First random walk after 1000001 steps, including 579 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 10) seen :28
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 452 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 9) seen :55
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 610 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 1000001 steps, including 406 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 8) seen :57
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 417 resets, run finished after 1540 ms. (steps per millisecond=649 ) properties (out of 7) seen :51
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 441 resets, run finished after 1172 ms. (steps per millisecond=853 ) properties (out of 6) seen :48
[2024-05-24 21:40:10] [INFO ] Invariant cache hit.
[2024-05-24 21:40:10] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 17 ms returned sat
[2024-05-24 21:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:10] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-24 21:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:40:11] [INFO ] [Nat]Absence check using 0 positive and 58 generalized place invariants in 17 ms returned sat
[2024-05-24 21:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:11] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-24 21:40:11] [INFO ] Computed and/alt/rep : 176/275/176 causal constraints (skipped 33 transitions) in 20 ms.
[2024-05-24 21:40:11] [INFO ] Added : 140 causal constraints over 28 iterations in 844 ms. Result :sat
Minimization took 173 ms.
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 27 ms returned sat
[2024-05-24 21:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using state equation in 154 ms returned unsat
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 28 ms returned sat
[2024-05-24 21:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using state equation in 111 ms returned unsat
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 26 ms returned sat
[2024-05-24 21:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:12] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:40:13] [INFO ] [Nat]Absence check using 0 positive and 58 generalized place invariants in 26 ms returned sat
[2024-05-24 21:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:13] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 21:40:13] [INFO ] Computed and/alt/rep : 176/275/176 causal constraints (skipped 33 transitions) in 19 ms.
[2024-05-24 21:40:13] [INFO ] Added : 66 causal constraints over 14 iterations in 389 ms. Result :sat
Minimization took 93 ms.
[2024-05-24 21:40:13] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 27 ms returned sat
[2024-05-24 21:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:13] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-24 21:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:40:14] [INFO ] [Nat]Absence check using 0 positive and 58 generalized place invariants in 29 ms returned sat
[2024-05-24 21:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:14] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 21:40:14] [INFO ] Computed and/alt/rep : 176/275/176 causal constraints (skipped 33 transitions) in 22 ms.
[2024-05-24 21:40:14] [INFO ] Added : 52 causal constraints over 11 iterations in 319 ms. Result :sat
Minimization took 80 ms.
[2024-05-24 21:40:14] [INFO ] [Real]Absence check using 0 positive and 58 generalized place invariants in 28 ms returned sat
[2024-05-24 21:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:14] [INFO ] [Real]Absence check using state equation in 153 ms returned unsat
Current structural bounds on expressions (after SMT) : [40, 11, 11, 11, 11, 11] Max seen :[7, 11, 11, 9, 9, 11]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 231/231 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 267 transition count 154
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 165 place count 190 transition count 154
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 165 place count 190 transition count 99
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 308 place count 102 transition count 99
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 319 place count 102 transition count 88
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 330 place count 91 transition count 88
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 341 place count 80 transition count 77
Ensure Unique test removed 11 places
Iterating global reduction 4 with 22 rules applied. Total rules applied 363 place count 69 transition count 77
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 22 rules applied. Total rules applied 385 place count 69 transition count 55
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 396 place count 58 transition count 55
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 407 place count 47 transition count 44
Applied a total of 407 rules in 48 ms. Remains 47 /278 variables (removed 231) and now considering 44/231 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 47/278 places, 44/231 transitions.
// Phase 1: matrix 44 rows 47 cols
[2024-05-24 21:40:15] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 22222 resets, run finished after 1882 ms. (steps per millisecond=531 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2114 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :11
[2024-05-24 21:40:17] [INFO ] Invariant cache hit.
[2024-05-24 21:40:17] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-24 21:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:17] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
Current structural bounds on expressions (after SMT) : [11] Max seen :[11]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 98068 ms.
BK_STOP 1716586818821
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r175-smll-171636280200241"
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 '
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 ;