About the Execution of 2022-gold for FamilyReunion-COL-L00100M0010C005P005G002
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.r191-tall-167838876200041.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 gold2022
Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876200041
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 14:29 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 140K 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-L00100M0010C005P005G002-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678564093455
Running Version 202205111006
[2023-03-11 19:48:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 19:48:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:48:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 19:48:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 19:48:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 839 ms
[2023-03-11 19:48:16] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2023-03-11 19:48:16] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-11 19:48:16] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2023-03-11 19:48:16] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 19:48:16] [INFO ] Computed 33 place invariants in 14 ms
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-03 101 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 19:48:16] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-11 19:48:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-11 19:48:16] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-11 19:48:16] [INFO ] Added : 44 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:16] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-11 19:48:16] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 19:48:17] [INFO ] Added : 46 causal constraints over 10 iterations in 72 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-11 19:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:17] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:17] [INFO ] Added : 18 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-11 19:48:17] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 19:48:17] [INFO ] Added : 62 causal constraints over 13 iterations in 107 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-11 19:48:17] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 19:48:17] [INFO ] Added : 40 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-11 19:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:17] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 19:48:18] [INFO ] Added : 53 causal constraints over 11 iterations in 94 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-11 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:18] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:18] [INFO ] Added : 64 causal constraints over 13 iterations in 98 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 19:48:18] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:18] [INFO ] Added : 14 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:18] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:18] [INFO ] Added : 53 causal constraints over 11 iterations in 70 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:18] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 19:48:18] [INFO ] Added : 58 causal constraints over 12 iterations in 82 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-11 19:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 19:48:19] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-11 19:48:19] [INFO ] Added : 31 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 19:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 19:48:19] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:19] [INFO ] Added : 31 causal constraints over 7 iterations in 45 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 19:48:19] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:19] [INFO ] Added : 33 causal constraints over 7 iterations in 82 ms. Result :sat
Minimization took 22 ms.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 19:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-11 19:48:19] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 19:48:19] [INFO ] Added : 13 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-11 19:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 19:48:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:48:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 19:48:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 19:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:48:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-11 19:48:20] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-11 19:48:20] [INFO ] Added : 19 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [101, 202, 101, 3, 101, 101, 3, 404, 101, 3, 808, 202, 101, 101, 101]
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 6
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 :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 3
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
[2023-03-11 19:48:20] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 317 ms.
[2023-03-11 19:48:20] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 101 places in 163 ms
Reduce places removed 122 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1511 ms. (steps per millisecond=6 ) properties (out of 15) seen :198
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 15) seen :0
// Phase 1: matrix 31114 rows 36917 cols
[2023-03-11 19:48:29] [INFO ] Computed 8803 place invariants in 4859 ms
Current structural bounds on expressions (after SMT) : [101, 202, 101, 3, 101, 101, 3, 404, 101, 3, 808, 202, 101, 101, 101] Max seen :[6, 4, 17, 0, 9, 0, 0, 20, 0, 0, 53, 12, 14, 44, 19]
Support contains 7072 out of 36917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Graph (complete) has 56168 edges and 36917 vertex of which 36683 are kept as prefixes of interest. Removing 234 places using SCC suffix rule.73 ms
Discarding 234 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 5858 places :
Implicit places reduction removed 5858 places
Drop transitions removed 11615 transitions
Trivial Post-agglo rules discarded 11615 transitions
Performed 11615 trivial Post agglomeration. Transition count delta: 11615
Iterating post reduction 0 with 17473 rules applied. Total rules applied 17474 place count 30825 transition count 19493
Reduce places removed 11615 places and 0 transitions.
Performed 808 Post agglomeration using F-continuation condition.Transition count delta: 808
Iterating post reduction 1 with 12423 rules applied. Total rules applied 29897 place count 19210 transition count 18685
Reduce places removed 808 places and 0 transitions.
Iterating post reduction 2 with 808 rules applied. Total rules applied 30705 place count 18402 transition count 18685
Performed 1515 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1515 Pre rules applied. Total rules applied 30705 place count 18402 transition count 17170
Deduced a syphon composed of 1515 places in 14 ms
Ensure Unique test removed 101 places
Reduce places removed 1616 places and 0 transitions.
Iterating global reduction 3 with 3131 rules applied. Total rules applied 33836 place count 16786 transition count 17170
Discarding 1515 places :
Symmetric choice reduction at 3 with 1515 rule applications. Total rules 35351 place count 15271 transition count 15655
Iterating global reduction 3 with 1515 rules applied. Total rules applied 36866 place count 15271 transition count 15655
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 3 with 101 rules applied. Total rules applied 36967 place count 15271 transition count 15554
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 4 with 101 rules applied. Total rules applied 37068 place count 15170 transition count 15554
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 37068 place count 15170 transition count 15453
Deduced a syphon composed of 101 places in 26 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 37270 place count 15069 transition count 15453
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 10 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 5 with 1010 rules applied. Total rules applied 38280 place count 14564 transition count 14948
Free-agglomeration rule (complex) applied 1212 times.
Iterating global reduction 5 with 1212 rules applied. Total rules applied 39492 place count 14564 transition count 13736
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 5 with 1212 rules applied. Total rules applied 40704 place count 13352 transition count 13736
Applied a total of 40704 rules in 11958 ms. Remains 13352 /36917 variables (removed 23565) and now considering 13736/31114 (removed 17378) transitions.
Finished structural reductions, in 1 iterations. Remains : 13352/36917 places, 13736/31114 transitions.
// Phase 1: matrix 13736 rows 13352 cols
[2023-03-11 19:49:57] [INFO ] Computed 2631 place invariants in 781 ms
Finished random walk after 213050 steps, including 99 resets, run visited all 15 properties in 30001 ms. (steps per millisecond=7 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 795427 steps, including 2 resets, run visited all 12 properties in 5001 ms. (steps per millisecond=159 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-00 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 173571 steps, including 0 resets, run visited all 11 properties in 5001 ms. (steps per millisecond=34 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-02 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 825451 steps, including 2 resets, run visited all 10 properties in 5001 ms. (steps per millisecond=165 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-06 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 3719 ms. (steps per millisecond=268 ) properties (out of 9) seen :392
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-09 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 254748 steps, including 1 resets, run visited all 8 properties in 5016 ms. (steps per millisecond=50 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-13 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 169638 steps, including 0 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=33 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-14 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 13736 rows 13352 cols
[2023-03-11 19:50:56] [INFO ] Computed 2631 place invariants in 766 ms
[2023-03-11 19:50:59] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 1529 ms returned sat
[2023-03-11 19:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:02] [INFO ] [Real]Absence check using state equation in 3298 ms returned unsat
[2023-03-11 19:51:05] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 1347 ms returned sat
[2023-03-11 19:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:29] [INFO ] [Real]Absence check using state equation in 23910 ms returned sat
[2023-03-11 19:51:32] [INFO ] Computed and/alt/rep : 8888/13332/8888 causal constraints (skipped 3737 transitions) in 1228 ms.
[2023-03-11 19:51:48] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 19:51:50] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 1365 ms returned sat
[2023-03-11 19:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:51:55] [INFO ] [Real]Absence check using state equation in 4824 ms returned unsat
[2023-03-11 19:51:59] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 1510 ms returned sat
[2023-03-11 19:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:04] [INFO ] [Real]Absence check using state equation in 5736 ms returned unsat
[2023-03-11 19:52:09] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 2524 ms returned sat
[2023-03-11 19:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:14] [INFO ] [Real]Absence check using state equation in 5046 ms returned unsat
[2023-03-11 19:52:18] [INFO ] [Real]Absence check using 0 positive and 2631 generalized place invariants in 2083 ms returned sat
[2023-03-11 19:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:52:48] [INFO ] [Real]Absence check using state equation in 30018 ms returned sat
[2023-03-11 19:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:52:52] [INFO ] [Nat]Absence check using 0 positive and 2631 generalized place invariants in 1527 ms returned sat
[2023-03-11 19:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:53:34] [INFO ] [Nat]Absence check using state equation in 42118 ms returned unknown
Current structural bounds on expressions (after SMT) : [101, 101, 101, 101, 101, 101] Max seen :[101, 26, 101, 101, 101, 35]
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-12 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-11 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-08 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-01 101 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1717 out of 13352 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13352/13352 places, 13736/13736 transitions.
Graph (complete) has 29897 edges and 13352 vertex of which 11228 are kept as prefixes of interest. Removing 2124 places using SCC suffix rule.8 ms
Discarding 2124 places :
Also discarding 1616 output transitions
Drop transitions removed 1616 transitions
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 2222 rules applied. Total rules applied 2223 place count 10117 transition count 11009
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 3334 place count 9006 transition count 11009
Performed 1212 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1212 Pre rules applied. Total rules applied 3334 place count 9006 transition count 9797
Deduced a syphon composed of 1212 places in 3 ms
Ensure Unique test removed 606 places
Reduce places removed 1818 places and 0 transitions.
Iterating global reduction 2 with 3030 rules applied. Total rules applied 6364 place count 7188 transition count 9797
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 6970 place count 7188 transition count 9191
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 7576 place count 6582 transition count 9191
Discarding 1010 places :
Symmetric choice reduction at 4 with 1010 rule applications. Total rules 8586 place count 5572 transition count 8181
Iterating global reduction 4 with 1010 rules applied. Total rules applied 9596 place count 5572 transition count 8181
Performed 707 Post agglomeration using F-continuation condition.Transition count delta: 707
Deduced a syphon composed of 707 places in 2 ms
Ensure Unique test removed 101 places
Reduce places removed 808 places and 0 transitions.
Iterating global reduction 4 with 1515 rules applied. Total rules applied 11111 place count 4764 transition count 7474
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 11313 place count 4663 transition count 7373
Free-agglomeration rule (complex) applied 1111 times.
Iterating global reduction 4 with 1111 rules applied. Total rules applied 12424 place count 4663 transition count 6262
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 4 with 1111 rules applied. Total rules applied 13535 place count 3552 transition count 6262
Applied a total of 13535 rules in 3313 ms. Remains 3552 /13352 variables (removed 9800) and now considering 6262/13736 (removed 7474) transitions.
Finished structural reductions, in 1 iterations. Remains : 3552/13352 places, 6262/13736 transitions.
// Phase 1: matrix 6262 rows 3552 cols
[2023-03-11 19:53:37] [INFO ] Computed 305 place invariants in 77 ms
Finished random walk after 601971 steps, including 850 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=20 )
Finished Best-First random walk after 348366 steps, including 2 resets, run visited all 2 properties in 5006 ms. (steps per millisecond=69 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-05 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 6262 rows 3552 cols
[2023-03-11 19:54:12] [INFO ] Computed 305 place invariants in 77 ms
[2023-03-11 19:54:13] [INFO ] [Real]Absence check using 0 positive and 305 generalized place invariants in 291 ms returned sat
[2023-03-11 19:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:18] [INFO ] [Real]Absence check using state equation in 4686 ms returned sat
[2023-03-11 19:54:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:54:19] [INFO ] [Nat]Absence check using 0 positive and 305 generalized place invariants in 110 ms returned sat
[2023-03-11 19:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:54:22] [INFO ] [Nat]Absence check using state equation in 2971 ms returned sat
[2023-03-11 19:54:22] [INFO ] Computed and/alt/rep : 1717/5353/1717 causal constraints (skipped 3434 transitions) in 539 ms.
[2023-03-11 19:54:28] [INFO ] Added : 73 causal constraints over 16 iterations in 5794 ms. Result :sat
Current structural bounds on expressions (after SMT) : [101] Max seen :[52]
Support contains 1111 out of 3552 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3552/3552 places, 6262/6262 transitions.
Graph (complete) has 12019 edges and 3552 vertex of which 2536 are kept as prefixes of interest. Removing 1016 places using SCC suffix rule.2 ms
Discarding 1016 places :
Also discarding 1818 output transitions
Drop transitions removed 1818 transitions
Applied a total of 1 rules in 99 ms. Remains 2536 /3552 variables (removed 1016) and now considering 4444/6262 (removed 1818) transitions.
Finished structural reductions, in 1 iterations. Remains : 2536/3552 places, 4444/6262 transitions.
// Phase 1: matrix 4444 rows 2536 cols
[2023-03-11 19:54:29] [INFO ] Computed 102 place invariants in 24 ms
Finished random walk after 816112 steps, including 2015 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=27 )
Finished Best-First random walk after 220318 steps, including 2 resets, run visited all 1 properties in 5006 ms. (steps per millisecond=44 )
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-UpperBounds-15 101 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 409930 ms.
BK_STOP 1678564505073
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-L00100M0010C005P005G002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, 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 r191-tall-167838876200041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00100M0010C005P005G002.tgz
mv FamilyReunion-COL-L00100M0010C005P005G002 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 ;