About the Execution of 2022-gold for HouseConstruction-PT-04000
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.r223-smll-167840362300075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is HouseConstruction-PT-04000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362300075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.9K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-04000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-04000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678579466633
Running Version 202205111006
[2023-03-12 00:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 00:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:04:29] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-12 00:04:29] [INFO ] Transformed 26 places.
[2023-03-12 00:04:29] [INFO ] Transformed 18 transitions.
[2023-03-12 00:04:29] [INFO ] Parsed PT model containing 26 places and 18 transitions in 248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 00:04:29] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 12005 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=1000 ) properties (out of 16) seen :4000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :248
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :122
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 :681
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :143
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :478
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :172
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 :144
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 :261
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :181
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 :130
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 :136
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 :133
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 :126
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 :188
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 :126
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 00:04:29] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-12 00:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 00:04:29] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 00:04:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:29] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:29] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-12 00:04:29] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 00:04:29] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:29] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 00:04:29] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 00:04:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:29] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 00:04:30] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:30] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 16 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-12 00:04:30] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:30] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:30] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:30] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:30] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:30] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:30] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:30] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 00:04:31] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 00:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:31] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:31] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 00:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 00:04:31] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:31] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 00:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 00:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:04:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 00:04:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-12 00:04:31] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [4000, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[4000, 48, 18, 168, 17, 477, 34, 20, 160, 160, 35, 19, 18, 168, 36, 17]
FORMULA HouseConstruction-PT-04000-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.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 24 ms. Remains 23 /26 variables (removed 3) and now considering 16/18 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/26 places, 16/18 transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 00:05:17] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000265 steps, including 15 resets, run finished after 220 ms. (steps per millisecond=4546 ) properties (out of 15) seen :60000
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 15) seen :16539
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 15) seen :3666
Incomplete Best-First random walk after 1000000 steps, including 4 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 15) seen :16011
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 15) seen :5706
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 15) seen :4014
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 15) seen :8357
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 15) seen :6253
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 15) seen :16738
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 15) seen :9000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 15) seen :3621
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 15) seen :6388
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 15) seen :4296
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 15) seen :4767
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 15) seen :7511
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 15) seen :5862
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 00:05:25] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-12 00:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:25] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-12 00:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:05:26] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000] Max seen :[4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000, 4000]
FORMULA HouseConstruction-PT-04000-UpperBounds-15 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-13 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-11 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-09 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-08 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-07 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-06 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-05 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-02 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-04000-UpperBounds-01 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 57519 ms.
BK_STOP 1678579526391
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-04000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is HouseConstruction-PT-04000, 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 r223-smll-167840362300075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-04000.tgz
mv HouseConstruction-PT-04000 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 ;