Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300525.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r135-tall-171631131300525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716375275045

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:54:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 10:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:54:36] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-22 10:54:36] [INFO ] Transformed 57 places.
[2024-05-22 10:54:36] [INFO ] Transformed 48 transitions.
[2024-05-22 10:54:36] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 48 rows 57 cols
[2024-05-22 10:54:36] [INFO ] Computed 9 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 5, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, +inf]
RANDOM walk for 10000 steps (339 resets) in 31 ms. (312 steps per ms)
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (853 resets) in 45 ms. (652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4] Max Struct:[5, 1, +inf]
[2024-05-22 10:54:36] [INFO ] Invariant cache hit.
[2024-05-22 10:54:36] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-22 10:54:36] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 8 ms returned unsat
[2024-05-22 10:54:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:36] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:54:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 10:54:36] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 10:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:54:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:36] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:54:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 10:54:36] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 10:54:37] [INFO ] Added : 46 causal constraints over 10 iterations in 64 ms. Result :sat
Minimization took 83 ms.
[2024-05-22 10:54:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:37] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:54:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:54:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:37] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 10:54:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-22 10:54:37] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 8 ms to minimize.
[2024-05-22 10:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 10:54:37] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 10:54:37] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
[2024-05-22 10:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 10:54:37] [INFO ] Added : 44 causal constraints over 9 iterations in 119 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4] Max Struct:[1, 1, +inf]
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4] Max Struct:[1, +inf]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 55 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 45 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 21 place count 45 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 42 transition count 35
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 29 transition count 22
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 29 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 27 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 27 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 26 transition count 19
Applied a total of 62 rules in 37 ms. Remains 26 /57 variables (removed 31) and now considering 19/48 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 26/57 places, 19/48 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 7=1, 8=1, 9=1, 12=1, 15=1, 16=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 7=1, 8=1, 9=1, 12=1, 15=1, 16=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1133 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :[1, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 4] Max Struct:[1, +inf]
// Phase 1: matrix 19 rows 26 cols
[2024-05-22 10:54:37] [INFO ] Computed 7 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 4] Max Struct:[1, +inf]
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (113362 resets) in 620 ms. (1610 steps per ms)
BEST_FIRST walk for 1000001 steps (77809 resets) in 417 ms. (2392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 10:54:38] [INFO ] Invariant cache hit.
[2024-05-22 10:54:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:54:38] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 10:54:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 10:54:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:38] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:54:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:38] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:54:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 10:54:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:54:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-22 10:54:38] [INFO ] Computed and/alt/rep : 18/51/18 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 10:54:38] [INFO ] Added : 16 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 19/19 transitions.
Graph (complete) has 69 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 24 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 24 transition count 18
Applied a total of 3 rules in 6 ms. Remains 24 /26 variables (removed 2) and now considering 18/19 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 24/26 places, 18/19 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 7=1, 8=1, 9=1, 11=1, 13=1, 14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 7=1, 8=1, 9=1, 11=1, 13=1, 14=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1119 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
// Phase 1: matrix 18 rows 24 cols
[2024-05-22 10:54:38] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (114296 resets) in 500 ms. (1996 steps per ms)
BEST_FIRST walk for 1000000 steps (78420 resets) in 350 ms. (2849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 10:54:39] [INFO ] Invariant cache hit.
[2024-05-22 10:54:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 10:54:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:54:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 10:54:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 10:54:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:54:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-22 10:54:39] [INFO ] Computed and/alt/rep : 17/51/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:54:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 10:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-22 10:54:39] [INFO ] Added : 16 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 10:54:40] [INFO ] Invariant cache hit.
[2024-05-22 10:54:40] [INFO ] Implicit Places using invariants in 39 ms returned [7, 13]
[2024-05-22 10:54:40] [INFO ] Actually due to overlaps returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/24 places, 18/18 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 22 transition count 17
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 17
Applied a total of 2 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 22 cols
[2024-05-22 10:54:40] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 10:54:40] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 10:54:40] [INFO ] Invariant cache hit.
[2024-05-22 10:54:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 74 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/24 places, 17/18 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 20 transition count 16
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 16
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 18 transition count 14
Applied a total of 6 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 18 cols
[2024-05-22 10:54:40] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:54:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:54:40] [INFO ] Invariant cache hit.
[2024-05-22 10:54:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 18/24 places, 14/18 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 182 ms. Remains : 18/24 places, 14/18 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 12=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 12=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1151 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 10:54:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (115854 resets) in 426 ms. (2341 steps per ms)
BEST_FIRST walk for 1000000 steps (78973 resets) in 325 ms. (3067 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 10:54:40] [INFO ] Invariant cache hit.
[2024-05-22 10:54:41] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-22 10:54:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-22 10:54:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:54:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 10:54:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-22 10:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:54:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 10:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-22 10:54:41] [INFO ] Computed and/alt/rep : 13/33/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 10:54:41] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-22 10:54:41] [INFO ] Invariant cache hit.
[2024-05-22 10:54:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:54:41] [INFO ] Invariant cache hit.
[2024-05-22 10:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 10:54:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-22 10:54:41] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-22 10:54:41] [INFO ] Invariant cache hit.
[2024-05-22 10:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 24 constraints, problems are : Problem set: 0 solved, 13 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 37 constraints, problems are : Problem set: 0 solved, 13 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 18/18 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 12=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 12=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1156 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40000 steps (4614 resets) in 472 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3196 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Probably explored full state space saw : 45 states, properties seen :0
Probabilistic random walk after 89 steps, saw 45 distinct states, run finished after 11 ms. (steps per millisecond=8 ) properties seen :0
Explored full state space saw : 45 states, properties seen :0
Exhaustive walk after 89 steps, saw 45 distinct states, run finished after 2 ms. (steps per millisecond=44 ) properties seen :0
FORMULA DoubleExponent-PT-001-UpperBounds-15 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5633 ms.
ITS solved all properties within timeout

BK_STOP 1716375281924

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DoubleExponent-PT-001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r135-tall-171631131300525"
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 ;