About the Execution of Smart+red for HouseConstruction-PT-01000
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.r203-smll-167840349800581.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 smartxred
Input is HouseConstruction-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349800581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 13:05 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-01000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-01000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678676672187
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-01000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 03:04:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 03:04:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 03:04:35] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-13 03:04:35] [INFO ] Transformed 26 places.
[2023-03-13 03:04:35] [INFO ] Transformed 18 transitions.
[2023-03-13 03:04:35] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-13 03:04:35] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 16) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :1179
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :1015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :1158
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 :1107
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 :1151
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :1118
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 :1134
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1136
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 :1159
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1114
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 :2014
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 :1109
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 :1116
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1212
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 :1115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1122
[2023-03-13 03:04:36] [INFO ] Invariant cache hit.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-13 03:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-13 03:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 03:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-13 03:04:36] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 03:04:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-13 03:04:36] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:36] [INFO ] Added : 10 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 14 ms.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 03:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:36] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 03:04:36] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 03:04:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:37] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-13 03:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:37] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:37] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:37] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:37] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-13 03:04:37] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:37] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 03:04:38] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 03:04:38] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 03:04:38] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-13 03:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:38] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 03:04:38] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 03:04:38] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1000, 1000, -1, -1, -1, -1, -1, 1000, -1, -1, 1000, -1, -1, 1000, -1, -1] Max seen :[1000, 1000, 20, 17, 51, 42, 20, 1000, 41, 18, 1000, 19, 25, 1000, 30, 19]
FORMULA HouseConstruction-PT-01000-UpperBounds-13 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-10 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 26 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 23 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 22 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 22 transition count 13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 21 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 13 place count 19 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 18 transition count 11
Applied a total of 14 rules in 111 ms. Remains 18 /26 variables (removed 8) and now considering 11/18 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 18/26 places, 11/18 transitions.
// Phase 1: matrix 11 rows 18 cols
[2023-03-13 03:04:47] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000094 steps, including 90 resets, run finished after 171 ms. (steps per millisecond=5848 ) properties (out of 11) seen :11000
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 11) seen :4406
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 11) seen :2589
Incomplete Best-First random walk after 1000000 steps, including 25 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 11) seen :3129
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 11) seen :2555
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 11) seen :4465
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 11) seen :3105
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 11) seen :2506
Incomplete Best-First random walk after 1000001 steps, including 13 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 11) seen :2469
Incomplete Best-First random walk after 1000000 steps, including 17 resets, run finished after 333 ms. (steps per millisecond=3003 ) properties (out of 11) seen :2360
Incomplete Best-First random walk after 1000000 steps, including 21 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 11) seen :2222
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 11) seen :2569
[2023-03-13 03:04:52] [INFO ] Invariant cache hit.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-13 03:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 03:04:52] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000] Max seen :[1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000]
FORMULA HouseConstruction-PT-01000-UpperBounds-15 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-14 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-12 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-09 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-08 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-01000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 17123 ms.
ITS solved all properties within timeout
BK_STOP 1678676693893
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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
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-01000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is HouseConstruction-PT-01000, 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 r203-smll-167840349800581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-01000.tgz
mv HouseConstruction-PT-01000 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 ;