About the Execution of 2023-gold for HouseConstruction-PT-02000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r219-smll-171649598000136.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HouseConstruction-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649598000136
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716669278707
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-02000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 20:34:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 20:34:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:34:41] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2024-05-25 20:34:41] [INFO ] Transformed 26 places.
[2024-05-25 20:34:41] [INFO ] Transformed 18 transitions.
[2024-05-25 20:34:41] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 18 rows 26 cols
[2024-05-25 20:34:41] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :4000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :2126
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :2163
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :2142
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :2120
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :2099
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :3112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :2164
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :2096
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :2121
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :2107
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :2015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :2102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :2139
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :2125
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :2222
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :2238
[2024-05-25 20:34:41] [INFO ] Invariant cache hit.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-25 20:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 20:34:42] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 20:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-25 20:34:42] [INFO ] Added : 8 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 20:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 20:34:42] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:42] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 20:34:42] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:42] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:43] [INFO ] Added : 13 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 20:34:43] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 20:34:43] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:43] [INFO ] Added : 12 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 20:34:43] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 20:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:43] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 20:34:43] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 20:34:44] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 20:34:44] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 20:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 20:34:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 20:34:44] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 20:34:44] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 2000, -1, -1, -1, -1, 2000, -1, -1, -1, -1, -1] Max seen :[59, 39, 16, 20, 20, 2000, 59, 30, 17, 29, 2000, 18, 24, 18, 39, 64]
FORMULA HouseConstruction-PT-02000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 24 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 24 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 23 transition count 16
Applied a total of 5 rules in 25 ms. Remains 23 /26 variables (removed 3) and now considering 16/18 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 23/26 places, 16/18 transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-05-25 20:35:04] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000532 steps, including 31 resets, run finished after 161 ms. (steps per millisecond=6214 ) properties (out of 14) seen :28000
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 14) seen :2716
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 14) seen :10636
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=1923 ) properties (out of 14) seen :5654
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 14) seen :4801
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 14) seen :3630
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 14) seen :4703
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 14) seen :2743
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 14) seen :5764
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 14) seen :2830
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 14) seen :3620
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 14) seen :8417
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 14) seen :5740
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 14) seen :8681
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 14) seen :8300
[2024-05-25 20:35:12] [INFO ] Invariant cache hit.
[2024-05-25 20:35:12] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:12] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2024-05-25 20:35:12] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-25 20:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:12] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2024-05-25 20:35:12] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-25 20:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-25 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 20:35:13] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000] Max seen :[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000]
FORMULA HouseConstruction-PT-02000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31981 ms.
BK_STOP 1716669314869
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-02000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HouseConstruction-PT-02000, 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 r219-smll-171649598000136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-02000.tgz
mv HouseConstruction-PT-02000 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 ;