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.r159-smll-167819445200056.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 DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445200056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678465766022

Running Version 202205111006
[2023-03-10 16:29: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-10 16:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:29:29] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-10 16:29:29] [INFO ] Transformed 57 places.
[2023-03-10 16:29:29] [INFO ] Transformed 48 transitions.
[2023-03-10 16:29:29] [INFO ] Parsed PT model containing 57 places and 48 transitions in 440 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 48 rows 57 cols
[2023-03-10 16:29:29] [INFO ] Computed 9 place invariants in 21 ms
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 343 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 15) seen :19
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :5
// Phase 1: matrix 48 rows 57 cols
[2023-03-10 16:29:29] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-10 16:29:29] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-10 16:29:29] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 16 ms returned unsat
[2023-03-10 16:29:29] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-10 16:29:29] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:30] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-10 16:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-10 16:29:30] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-10 16:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-10 16:29:30] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
[2023-03-10 16:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-10 16:29:30] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-10 16:29:30] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2023-03-10 16:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-10 16:29:30] [INFO ] Added : 45 causal constraints over 9 iterations in 261 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[1, 4]
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 52 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.59 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 51 transition count 34
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 39 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 28 place count 39 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 36 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 35 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 35 transition count 30
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 23 transition count 18
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 21 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 20 transition count 15
Applied a total of 68 rules in 109 ms. Remains 20 /57 variables (removed 37) and now considering 15/48 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/57 places, 15/48 transitions.
// Phase 1: matrix 15 rows 20 cols
[2023-03-10 16:29:30] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 115656 resets, run finished after 1373 ms. (steps per millisecond=728 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 79255 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :4
// Phase 1: matrix 15 rows 20 cols
[2023-03-10 16:29:33] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 16:29:33] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-10 16:29:33] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 16:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-10 16:29:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:33] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 16:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-10 16:29:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:29:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2023-03-10 16:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-10 16:29:33] [INFO ] Computed and/alt/rep : 14/43/14 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 16:29:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-10 16:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 16:29:33] [INFO ] Added : 13 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 15/15 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 20 cols
[2023-03-10 16:29:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:29:33] [INFO ] Implicit Places using invariants in 74 ms returned [6, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 18/20 places, 15/15 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 17 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 13
Applied a total of 4 rules in 7 ms. Remains 16 /18 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:33] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:33] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-10 16:29:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:33] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 16/20 places, 13/15 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/20 places, 13/15 transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:33] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 127196 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84368 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 1) seen :10
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-10 16:29:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:34] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-10 16:29:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:29:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2023-03-10 16:29:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-10 16:29:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-10 16:29:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:29:35] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:35] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:35] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:35] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-10 16:29:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-10 16:29:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:35] [INFO ] Computed 4 place invariants in 10 ms
[2023-03-10 16:29:35] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:35] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 126630 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000000 steps, including 84042 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :9
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-10 16:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:36] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-10 16:29:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
[2023-03-10 16:29:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:29:36] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2023-03-10 16:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-10 16:29:36] [INFO ] Added : 11 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[12]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:36] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 16:29:36] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-10 16:29:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:36] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:36] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 126865 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84078 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :8
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 16:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-10 16:29:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2023-03-10 16:29:38] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-10 16:29:38] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[12]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:38] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:38] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-10 16:29:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:38] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting property specific reduction for DoubleExponent-PT-001-UpperBounds-15
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :6
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-10 16:29:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:38] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-10 16:29:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-10 16:29:38] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:29:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-10 16:29:38] [INFO ] Added : 11 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[8]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:38] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 126896 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 84063 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :10
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 16:29:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 16:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-10 16:29:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-10 16:29:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2023-03-10 16:29:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2023-03-10 16:29:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2023-03-10 16:29:40] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 16:29:40] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:40] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:40] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-10 16:29:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:40] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 126868 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 84201 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 1) seen :10
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:41] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 16:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 16:29:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:29:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 16:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:29:41] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-10 16:29:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-10 16:29:41] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-10 16:29:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2023-03-10 16:29:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2023-03-10 16:29:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 16:29:41] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:41] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 16:29:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 16:29:42] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-10 16:29:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-10 16:29:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 16:29:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Ending property specific reduction for DoubleExponent-PT-001-UpperBounds-15 in 3562 ms.
[2023-03-10 16:29:42] [INFO ] Flatten gal took : 34 ms
[2023-03-10 16:29:42] [INFO ] Applying decomposition
[2023-03-10 16:29:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4083480717057339372.txt' '-o' '/tmp/graph4083480717057339372.bin' '-w' '/tmp/graph4083480717057339372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4083480717057339372.bin' '-l' '-1' '-v' '-w' '/tmp/graph4083480717057339372.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:29:42] [INFO ] Decomposing Gal with order
[2023-03-10 16:29:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:29:42] [INFO ] Removed a total of 1 redundant transitions.
[2023-03-10 16:29:42] [INFO ] Flatten gal took : 100 ms
[2023-03-10 16:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-10 16:29:42] [INFO ] Time to serialize gal into /tmp/UpperBounds14381753429200277868.gal : 3 ms
[2023-03-10 16:29:42] [INFO ] Time to serialize properties into /tmp/UpperBounds15143113749716584270.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14381753429200277868.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15143113749716584270.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds15143113749716584270.prop.
Detected timeout of ITS tools.
[2023-03-10 16:49:46] [INFO ] Flatten gal took : 4 ms
[2023-03-10 16:49:46] [INFO ] Time to serialize gal into /tmp/UpperBounds2010573030360792696.gal : 2 ms
[2023-03-10 16:49:46] [INFO ] Time to serialize properties into /tmp/UpperBounds4271824889542798353.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2010573030360792696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4271824889542798353.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds4271824889542798353.prop.
Detected timeout of ITS tools.
[2023-03-10 17:09:51] [INFO ] Flatten gal took : 10 ms
[2023-03-10 17:09:51] [INFO ] Input system was already deterministic with 13 transitions.
[2023-03-10 17:09:51] [INFO ] Transformed 16 places.
[2023-03-10 17:09:51] [INFO ] Transformed 13 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 17:09:51] [INFO ] Time to serialize gal into /tmp/UpperBounds2707128469567033119.gal : 1 ms
[2023-03-10 17:09:51] [INFO ] Time to serialize properties into /tmp/UpperBounds13214092678348739630.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2707128469567033119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13214092678348739630.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13214092678348739630.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r159-smll-167819445200056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;