About the Execution of Marcie+red for FamilyReunion-COL-L01200M0120C060P060G030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.680 | 3600000.00 | 3740198.00 | 70158.40 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857100357.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-COL-L01200M0120C060P060G030, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857100357
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.3K Feb 26 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 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 211K 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-L01200M0120C060P060G030-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678521881828
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L01200M0120C060P060G030
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 08:04:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 08:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:04:43] [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 08:04:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 08:04:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 741 ms
[2023-03-11 08:04:44] [INFO ] Detected 5 constant HL places corresponding to 306 PT places.
[2023-03-11 08:04:44] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 4614109 PT places and 4406530.0 transition bindings in 80 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-11 08:04:44] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 7 ms.
[2023-03-11 08:04:44] [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 08:04:44] [INFO ] Computed 33 place invariants in 17 ms
[2023-03-11 08:04:44] [INFO ] Invariant cache hit.
[2023-03-11 08:04:44] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:44] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-11 08:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-11 08:04:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 08:04:44] [INFO ] Added : 62 causal constraints over 13 iterations in 107 ms. Result :sat
Minimization took 18 ms.
[2023-03-11 08:04:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-11 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 08:04:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:04:45] [INFO ] Added : 32 causal constraints over 7 iterations in 49 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 08:04:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-11 08:04:45] [INFO ] Added : 61 causal constraints over 13 iterations in 88 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-11 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 08:04:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 08:04:45] [INFO ] Added : 44 causal constraints over 9 iterations in 72 ms. Result :sat
Minimization took 11 ms.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-11 08:04:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:45] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-11 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:46] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:04:46] [INFO ] Added : 23 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 10 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:46] [INFO ] Added : 42 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 14 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:46] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:04:46] [INFO ] Added : 45 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:04:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 08:04:46] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-11 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 08:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-11 08:04:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:47] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-11 08:04:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 08:04:47] [INFO ] Added : 28 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 13 ms.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 08:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 08:04:47] [INFO ] Added : 31 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 15 ms.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:04:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:04:47] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-11 08:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-11 08:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-11 08:04:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 08:04:47] [INFO ] Added : 64 causal constraints over 13 iterations in 72 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [31, 1201, 31, 2402, 7206, 1201, 1201, 2402, 1201, 2402, 1201, 1201, 1201, 13211, 1201, 1201]
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 61
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 31
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 08:04:55] [INFO ] Unfolded HLPN to a Petri net with 4073269 places and 3540609 transitions 10178597 arcs in 8275 ms.
[2023-03-11 08:04:55] [INFO ] Unfolded 16 HLPN properties in 34 ms.
Deduced a syphon composed of 1201 places in 10283 ms
Reduce places removed 1387 places and 0 transitions.
Interrupted random walk after 1757 steps, including 0 resets, run timeout after 30018 ms. (steps per millisecond=0 ) properties seen 348
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1113 ms. (steps per millisecond=8 ) properties (out of 16) seen :0
Interrupted Best-First random walk after 2524 steps, including 0 resets, run timeout after 5372 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Interrupted Best-First random walk after 1202 steps, including 0 resets, run timeout after 5080 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1202 steps, including 0 resets, run timeout after 5742 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=10 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 16) seen :0
Interrupted Best-First random walk after 1202 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2203 steps, including 0 resets, run timeout after 8748 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 895 ms. (steps per millisecond=11 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
Interrupted Best-First random walk after 2203 steps, including 0 resets, run timeout after 8772 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 16) seen :0
// Phase 1: matrix 3540609 rows 4071882 cols
[2023-03-11 08:09:03] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 08:09: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 08:09:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 08:09:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Unfolding complete |P|=4612908|T|=4405329|A|=13507769
Time for unfolding: 2m54.588sec
Net: FamilyReunion_COL_L01200M0120C060P060G030
(NrP: 4612908 NrTr: 4405329 NrArc: 13507769)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 327028 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16221988 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
c0_CINFORMI0
c0_CINFORMI1
c0_CINFORMI2
c0_CINFORMI3
c0_CINFORMI4
c0_CINFORMI5
c0_CINFORMI6
c0_CINFORMI7
c0_CINFORMI8
c0_CINFORMI9
c0_CINFORMI10
c0_CINFORMI11
c0_CINFORMI12
c0_CINFORMI13
c0_CINFORMI14
c0_CINFORMI15
c0_CINFORMI16
c0_CINFORMI17
c0_CINFORMI18
c0_CINFORMI19
c0_CINFORMI20
c0_CINFORMI21
c0_CINFORMI22
c0_CINFORMI23
c0_CINFORMI24
c0_CINFORMI25
c0_CINFORMI26
c0_CINFORMI27
c0_CINFORMI28
c0_CINFORMI29
c0_CINFORMI30
c0_CINFORMI31
c0_CINFORMI32
c0_CINFORMI33
c0_CINFORMI34
c0_CINFORMI35
c0_CINFORMI36
c0_CINFORMI37
c0_CINFORMI38
c0_CINFORMI39
c0_CINFORMI40
c0_CINFORMI41
c0_CINFORMI42
c0_CINFORMI43
c0_CINFORMI44
c0_CINFORMI45
c0_CINFORMI46
c0_CINFORMI47
c0_CINFORMI48
c0_CINFORMI49
c0_CINFORMI50
c0_CINFORMI51
c0_CINFORMI52
c0_CINFORMI53
c0_CINFORMI54
c0_CINFORMI55
c0_CINFORMI56
c0_CINFORMI57
c0_CINFORMI58
c0_CINFORMI59
c0_CINFORMI60
c2_CINFORMI0
c2_CINFORMI1
c2_CINFORMI2
c2_CINFORMI3
c2_CINFORMI4
c2_CINFORMI5
c2_CINFORMI6
c2_CINFORMI7
c2_CINFORMI8
c2_CINFORMI9
c2_CINFORMI10
c2_CINFORMI11
c2_CINFORMI12
c2_CINFORMI13
c2_CINFORMI14
c2_CINFORMI15
c2_CINFORMI16
c2_CINFORMI17
c2_CINFORMI18
c2_CINFORMI19
c2_CINFORMI20
c2_CINFORMI21
c2_CINFORMI22
c2_CINFORMI23
c2_CINFORMI24
c2_CINFORMI25
c2_CINFORMI26
c2_CINFORMI27
c2_CINFORMI28
c2_CINFORMI29
c2_CINFORMI30
c2_CINFORMI31
c2_CINFORMI32
c2_CINFORMI33
c2_CINFORMI34
c2_CINFORMI35
c2_CINFORMI36
c2_CINFORMI37
c2_CINFORMI38
c2_CINFORMI39
c2_CINFORMI40
c2_CINFORMI41
c2_CINFORMI42
c2_CINFORMI43
c2_CINFORMI44
c2_CINFORMI45
c2_CINFORMI46
c2_CINFORMI47
c2_CINFORMI48
c2_CINFORMI49
c2_CINFORMI50
c2_CINFORMI51
c2_CINFORMI52
c2_CINFORMI53
c2_CINFORMI54
c2_CINFORMI55
c2_CINFORMI56
c2_CINFORMI57
c2_CINFORMI58
c2_CINFORMI59
c2_CINFORMI60
m0_MICSystem0
m0_MICSystem1
m0_MICSystem2
m0_MICSystem3
m0_MICSystem4
m0_MICSystem5
m0_MICSystem6
m0_MICSystem7
m0_MICSystem8
m0_MICSystem9
m0_MICSystem10
m0_MICSystem11
m0_MICSystem12
m0_MICSystem13
m0_MICSystem14
m0_MICSystem15
m0_MICSystem16
m0_MICSystem17
m0_MICSystem18
m0_MICSystem19
m0_MICSystem20
m0_MICSystem21
m0_MICSystem22
m0_MICSystem23
m0_MICSystem24
m0_MICSystem25
m0_MICSystem26
m0_MICSystem27
m0_MICSystem28
m0_MICSystem29
m0_MICSystem30
m0_MICSystem31
m0_MICSystem32
m0_MICSystem33
m0_MICSystem34
m0_MICSystem35
m0_MICSystem36
m0_MICSystem37
m0_MICSystem38
m0_MICSystem39
m0_MICSystem40
m0_MICSystem41
m0_MICSystem42
m0_MICSystem43
m0_MICSystem44
m0_MICSystem45
m0_MICSystem46
m0_MICSystem47
m0_MICSystem48
m0_MICSystem49
m0_MICSystem50
m0_MICSystem51
m0_MICSystem52
m0_MICSystem53
m0_MICSystem54
m0_MICSystem55
m0_MICSystem56
m0_MICSystem57
m0_MICSystem58
m0_MICSystem59
m0_MICSystem60
m0_MICSystem61
m0_MICSystem62
m0_MICSystem63
m0_MICSystem64
m0_MICSystem65
m0_MICSystem66
m0_MICSystem67
m0_MICSystem68
m0_MICSystem69
m0_MICSystem70
m0_MICSystem71
m0_MICSystem72
m0_MICSystem73
m0_MICSystem74
m0_MICSystem75
m0_MICSystem76
m0_MICSystem77
m0_MICSystem78
m0_MICSystem79
m0_MICSystem80
m0_MICSystem81
m0_MICSystem82
m0_MICSystem83
m0_MICSystem84
m0_MICSystem85
m0_MICSystem86
m0_MICSystem87
m0_MICSystem88
m0_MICSystem89
m0_MICSystem90
m0_MICSystem91
m0_MICSystem92
m0_MICSystem93
m0_MICSystem94
m0_MICSystem95
m0_MICSystem96
m0_MICSystem97
m0_MICSystem98
m0_MICSystem99
m0_MICSystem100
m0_MICSystem101
m0_MICSystem102
m0_MICSystem103
m0_MICSystem104
m0_MICSystem105
m0_MICSystem106
m0_MICSystem107
m0_MICSystem108
m0_MICSystem109
m0_MICSystem110
m0_MICSystem111
m0_MICSystem112
m0_MICSystem113
m0_MICSystem114
m0_MICSystem115
m0_MICSystem116
m0_MICSystem117
m0_MICSystem118
m0_MICSystem119
m0_MICSystem120
p0_PublicAdminOffice0
p0_PublicAdminOffice1
p0_PublicAdminOffice2
p0_PublicAdminOffice3
p0_PublicAdminOffice4
p0_PublicAdminOffice5
p0_PublicAdminOffice6
p0_PublicAdminOffice7
p0_PublicAdminOffice8
p0_PublicAdminOffice9
p0_PublicAdminOffice10
p0_PublicAdminOffice11
p0_PublicAdminOffice12
p0_PublicAdminOffice13
p0_PublicAdminOffice14
p0_PublicAdminOffice15
p0_PublicAdminOffice16
p0_PublicAdminOffice17
p0_PublicAdminOffice18
p0_PublicAdminOffice19
p0_PublicAdminOffice20
p0_PublicAdminOffice21
p0_PublicAdminOffice22
p0_PublicAdminOffice23
p0_PublicAdminOffice24
p0_PublicAdminOffice25
p0_PublicAdminOffice26
p0_PublicAdminOffice27
p0_PublicAdminOffice28
p0_PublicAdminOffice29
p0_PublicAdminOffice30
p0_PublicAdminOffice31
p0_PublicAdminOffice32
p0_PublicAdminOffice33
p0_PublicAdminOffice34
p0_PublicAdminOffice35
p0_PublicAdminOffice36
p0_PublicAdminOffice37
p0_PublicAdminOffice38
p0_PublicAdminOffice39
p0_PublicAdminOffice40
p0_PublicAdminOffice41
p0_PublicAdminOffice42
p0_PublicAdminOffice43
p0_PublicAdminOffice44
p0_PublicAdminOffice45
p0_PublicAdminOffice46
p0_PublicAdminOffice47
p0_PublicAdminOffice48
p0_PublicAdminOffice49
p0_PublicAdminOffice50
p0_PublicAdminOffice51
p0_PublicAdminOffice52
p0_PublicAdminOffice53
p0_PublicAdminOffice54
p0_PublicAdminOffice55
p0_PublicAdminOffice56
p0_PublicAdminOffice57
p0_PublicAdminOffice58
p0_PublicAdminOffice59
p0_PublicAdminOffice60
r0_Response0
r0_Response1
found 306 constant places
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-L01200M0120C060P060G030"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-COL-L01200M0120C060P060G030, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857100357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L01200M0120C060P060G030.tgz
mv FamilyReunion-COL-L01200M0120C060P060G030 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 ;