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.r138-smll-167819420700453.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 marciexred
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420700453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678840333548

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:32:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 00:32:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:32:17] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-15 00:32:17] [INFO ] Transformed 110 places.
[2023-03-15 00:32:17] [INFO ] Transformed 98 transitions.
[2023-03-15 00:32:17] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 00:32:17] [INFO ] Computed 14 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 327 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :8
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 294 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
[2023-03-15 00:32:17] [INFO ] Invariant cache hit.
[2023-03-15 00:32:17] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-15 00:32:17] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 00:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:17] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-15 00:32:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:18] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-15 00:32:18] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 3 ms to minimize.
[2023-03-15 00:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-15 00:32:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-15 00:32:18] [INFO ] Added : 93 causal constraints over 19 iterations in 496 ms. Result :sat
Minimization took 77 ms.
[2023-03-15 00:32:18] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:19] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-15 00:32:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:19] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-15 00:32:19] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2023-03-15 00:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 00:32:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-15 00:32:19] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2023-03-15 00:32:19] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 3 ms to minimize.
[2023-03-15 00:32:20] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2023-03-15 00:32:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2023-03-15 00:32:20] [INFO ] Added : 94 causal constraints over 20 iterations in 791 ms. Result :sat
Minimization took 66 ms.
[2023-03-15 00:32:20] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-15 00:32:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:20] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-15 00:32:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 00:32:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:20] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-15 00:32:20] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2023-03-15 00:32:20] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2023-03-15 00:32:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-15 00:32:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-15 00:32:21] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2023-03-15 00:32:21] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2023-03-15 00:32:21] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2023-03-15 00:32:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2023-03-15 00:32:21] [INFO ] Added : 94 causal constraints over 19 iterations in 712 ms. Result :sat
Minimization took 80 ms.
[2023-03-15 00:32:21] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-15 00:32:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:21] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-15 00:32:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-15 00:32:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:21] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-15 00:32:21] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2023-03-15 00:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-15 00:32:21] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 00:32:22] [INFO ] Added : 90 causal constraints over 18 iterations in 312 ms. Result :sat
Minimization took 58 ms.
[2023-03-15 00:32:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 00:32:22] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:22] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-15 00:32:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:22] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:22] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-15 00:32:22] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2023-03-15 00:32:22] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2023-03-15 00:32:22] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2023-03-15 00:32:22] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2023-03-15 00:32:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2023-03-15 00:32:22] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-15 00:32:23] [INFO ] Added : 85 causal constraints over 17 iterations in 278 ms. Result :sat
Minimization took 37 ms.
[2023-03-15 00:32:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 00:32:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:23] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-15 00:32:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-15 00:32:23] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 00:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:23] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 3 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2023-03-15 00:32:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 556 ms
[2023-03-15 00:32:23] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 00:32:24] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2023-03-15 00:32:24] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2023-03-15 00:32:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-15 00:32:24] [INFO ] Added : 90 causal constraints over 18 iterations in 472 ms. Result :sat
Minimization took 88 ms.
[2023-03-15 00:32:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:24] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:24] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-15 00:32:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:24] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:24] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-15 00:32:24] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2023-03-15 00:32:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 00:32:24] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 00:32:25] [INFO ] Added : 91 causal constraints over 19 iterations in 366 ms. Result :sat
Minimization took 62 ms.
[2023-03-15 00:32:25] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 00:32:25] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-15 00:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:25] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-15 00:32:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 00:32:25] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:25] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-15 00:32:25] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2023-03-15 00:32:25] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2023-03-15 00:32:25] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-15 00:32:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2023-03-15 00:32:25] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 00:32:25] [INFO ] Added : 75 causal constraints over 15 iterations in 273 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1, 67, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 107 transition count 83
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 92 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 89 transition count 80
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 37 place count 89 transition count 75
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 84 transition count 75
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 85 place count 65 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 63 transition count 56
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 94 place count 63 transition count 51
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 99 place count 58 transition count 51
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 57 transition count 50
Applied a total of 107 rules in 88 ms. Remains 57 /110 variables (removed 53) and now considering 50/98 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 57/110 places, 50/98 transitions.
// Phase 1: matrix 50 rows 57 cols
[2023-03-15 00:32:26] [INFO ] Computed 11 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 128059 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties (out of 8) seen :11
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 84805 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 84885 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 84661 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000000 steps, including 84631 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000000 steps, including 84464 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 84645 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 6) seen :9
[2023-03-15 00:32:32] [INFO ] Invariant cache hit.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-15 00:32:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 9 ms returned sat
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-15 00:32:32] [INFO ] Computed and/alt/rep : 49/168/49 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 00:32:32] [INFO ] Added : 24 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 19 ms.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 00:32:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-03-15 00:32:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 185 ms
[2023-03-15 00:32:32] [INFO ] Computed and/alt/rep : 49/168/49 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 00:32:32] [INFO ] Added : 23 causal constraints over 5 iterations in 64 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 00:32:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:33] [INFO ] Computed and/alt/rep : 49/168/49 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 00:32:33] [INFO ] Added : 41 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 25 ms.
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:33] [INFO ] Computed and/alt/rep : 49/168/49 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 00:32:33] [INFO ] Added : 46 causal constraints over 10 iterations in 109 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-15 00:32:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-15 00:32:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:33] [INFO ] Computed and/alt/rep : 49/168/49 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:33] [INFO ] Added : 39 causal constraints over 8 iterations in 72 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1, 1] Max seen :[4, 4, 0, 0, 1, 0]
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 50/50 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 8 place count 53 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 53 transition count 46
Applied a total of 9 rules in 11 ms. Remains 53 /57 variables (removed 4) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 53/57 places, 46/50 transitions.
// Phase 1: matrix 46 rows 53 cols
[2023-03-15 00:32:33] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 128362 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 84960 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84861 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84722 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 85041 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 84809 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 5) seen :8
[2023-03-15 00:32:38] [INFO ] Invariant cache hit.
[2023-03-15 00:32:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:38] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 00:32:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:38] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 00:32:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:38] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 00:32:39] [INFO ] Added : 39 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 57 ms.
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 00:32:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2023-03-15 00:32:39] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-15 00:32:39] [INFO ] Added : 34 causal constraints over 7 iterations in 146 ms. Result :sat
Minimization took 30 ms.
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-15 00:32:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:39] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:39] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-15 00:32:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 00:32:39] [INFO ] Added : 40 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:40] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:32:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:40] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:40] [INFO ] Added : 39 causal constraints over 8 iterations in 113 ms. Result :sat
Minimization took 41 ms.
[2023-03-15 00:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 00:32:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:40] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-15 00:32:40] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-15 00:32:40] [INFO ] Computed and/alt/rep : 45/175/45 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-15 00:32:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-15 00:32:40] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-15 00:32:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-15 00:32:40] [INFO ] Added : 40 causal constraints over 8 iterations in 237 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1] Max seen :[4, 4, 0, 0, 0]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 9 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 53/53 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 5 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-15 00:32:40] [INFO ] Invariant cache hit.
[2023-03-15 00:32:40] [INFO ] Implicit Places using invariants in 92 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/53 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 45
Applied a total of 2 rules in 8 ms. Remains 51 /52 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 51 cols
[2023-03-15 00:32:40] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-15 00:32:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-15 00:32:41] [INFO ] Invariant cache hit.
[2023-03-15 00:32:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:41] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 250 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/53 places, 45/46 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 44
Applied a total of 2 rules in 7 ms. Remains 48 /49 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 00:32:41] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-15 00:32:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-15 00:32:41] [INFO ] Invariant cache hit.
[2023-03-15 00:32:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 48/53 places, 44/46 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 536 ms. Remains : 48/53 places, 44/46 transitions.
[2023-03-15 00:32:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144054 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91373 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91367 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91446 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000000 steps, including 91389 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 1000001 steps, including 91464 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 5) seen :8
[2023-03-15 00:32:45] [INFO ] Invariant cache hit.
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 00:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 00:32:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:45] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 00:32:45] [INFO ] Added : 38 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 00:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-15 00:32:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-15 00:32:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2023-03-15 00:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-15 00:32:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-15 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2023-03-15 00:32:46] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 00:32:46] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:46] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:46] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-15 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-15 00:32:46] [INFO ] Added : 40 causal constraints over 8 iterations in 151 ms. Result :sat
Minimization took 39 ms.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:46] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:46] [INFO ] Added : 40 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 27 ms.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-15 00:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:32:46] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-15 00:32:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-15 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-15 00:32:47] [INFO ] Added : 33 causal constraints over 7 iterations in 174 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 12, 1, 1] Max seen :[4, 4, 0, 0, 0]
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-15 00:32:47] [INFO ] Invariant cache hit.
[2023-03-15 00:32:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-15 00:32:47] [INFO ] Invariant cache hit.
[2023-03-15 00:32:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:47] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-15 00:32:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 00:32:47] [INFO ] Invariant cache hit.
[2023-03-15 00:32:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 48/48 places, 44/44 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-00
[2023-03-15 00:32:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-15 00:32:47] [INFO ] Invariant cache hit.
[2023-03-15 00:32:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:47] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 00:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:47] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-15 00:32:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:47] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2023-03-15 00:32:47] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 00:32:47] [INFO ] Added : 38 causal constraints over 9 iterations in 85 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 45 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 44 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 42 transition count 39
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 42 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 40 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 40 transition count 37
Applied a total of 15 rules in 16 ms. Remains 40 /48 variables (removed 8) and now considering 37/44 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 40/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 40 cols
[2023-03-15 00:32:47] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144137 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 91646 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 1) seen :4
[2023-03-15 00:32:49] [INFO ] Invariant cache hit.
[2023-03-15 00:32:49] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:49] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:49] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:49] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:49] [INFO ] Computed and/alt/rep : 36/155/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 00:32:49] [INFO ] Added : 33 causal constraints over 7 iterations in 81 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 40/40 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-15 00:32:49] [INFO ] Invariant cache hit.
[2023-03-15 00:32:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-15 00:32:49] [INFO ] Invariant cache hit.
[2023-03-15 00:32:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-15 00:32:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 00:32:49] [INFO ] Invariant cache hit.
[2023-03-15 00:32:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 40/40 places, 37/37 transitions.
[2023-03-15 00:32:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144061 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 91464 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 1) seen :4
[2023-03-15 00:32:51] [INFO ] Invariant cache hit.
[2023-03-15 00:32:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:51] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-15 00:32:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:51] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-15 00:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:51] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:32:51] [INFO ] Computed and/alt/rep : 36/155/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 00:32:51] [INFO ] Added : 33 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 40/40 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 37/37 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-15 00:32:51] [INFO ] Invariant cache hit.
[2023-03-15 00:32:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-15 00:32:51] [INFO ] Invariant cache hit.
[2023-03-15 00:32:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-15 00:32:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 00:32:51] [INFO ] Invariant cache hit.
[2023-03-15 00:32:51] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 40/40 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-00 in 4514 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 00:32:51] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
[2023-03-15 00:32:52] [INFO ] Invariant cache hit.
[2023-03-15 00:32:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:52] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:52] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-15 00:32:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:32:52] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-15 00:32:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:52] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2023-03-15 00:32:52] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-15 00:32:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-15 00:32:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-15 00:32:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2023-03-15 00:32:52] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:52] [INFO ] Added : 18 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 43 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 43 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 38
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 40 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 38 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 38 transition count 36
Applied a total of 17 rules in 25 ms. Remains 38 /48 variables (removed 10) and now considering 36/44 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 38/48 places, 36/44 transitions.
// Phase 1: matrix 36 rows 38 cols
[2023-03-15 00:32:52] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144319 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 91336 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :4
[2023-03-15 00:32:53] [INFO ] Invariant cache hit.
[2023-03-15 00:32:53] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:53] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-15 00:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:53] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-15 00:32:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:53] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 197 ms
[2023-03-15 00:32:54] [INFO ] Computed and/alt/rep : 35/162/35 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:54] [INFO ] Added : 17 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 38/38 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-15 00:32:54] [INFO ] Invariant cache hit.
[2023-03-15 00:32:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-15 00:32:54] [INFO ] Invariant cache hit.
[2023-03-15 00:32:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:54] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-15 00:32:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 00:32:54] [INFO ] Invariant cache hit.
[2023-03-15 00:32:54] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 38/38 places, 36/36 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 2539 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 00:32:54] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-15 00:32:54] [INFO ] Invariant cache hit.
[2023-03-15 00:32:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:54] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:54] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-15 00:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:54] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:54] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 00:32:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-15 00:32:54] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 00:32:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-15 00:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 00:32:54] [INFO ] Added : 40 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 45 transition count 42
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 45 transition count 39
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 11 place count 42 transition count 39
Applied a total of 11 rules in 14 ms. Remains 42 /48 variables (removed 6) and now considering 39/44 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 42/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 42 cols
[2023-03-15 00:32:54] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144343 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91417 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 1) seen :0
[2023-03-15 00:32:56] [INFO ] Invariant cache hit.
[2023-03-15 00:32:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:56] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:56] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:56] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2023-03-15 00:32:56] [INFO ] Computed and/alt/rep : 38/165/38 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:32:56] [INFO ] Added : 29 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 42/42 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 00:32:56] [INFO ] Invariant cache hit.
[2023-03-15 00:32:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-15 00:32:56] [INFO ] Invariant cache hit.
[2023-03-15 00:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:56] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 41/42 places, 39/39 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 39
Applied a total of 1 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-15 00:32:56] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-15 00:32:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-15 00:32:56] [INFO ] Invariant cache hit.
[2023-03-15 00:32:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:56] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/42 places, 39/39 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 388 ms. Remains : 41/42 places, 39/39 transitions.
[2023-03-15 00:32:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144484 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91041 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
[2023-03-15 00:32:58] [INFO ] Invariant cache hit.
[2023-03-15 00:32:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:58] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:58] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:58] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:58] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:32:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2023-03-15 00:32:58] [INFO ] Computed and/alt/rep : 38/166/38 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 00:32:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-15 00:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-15 00:32:58] [INFO ] Added : 33 causal constraints over 7 iterations in 140 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 00:32:58] [INFO ] Invariant cache hit.
[2023-03-15 00:32:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-15 00:32:59] [INFO ] Invariant cache hit.
[2023-03-15 00:32:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:59] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-15 00:32:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 00:32:59] [INFO ] Invariant cache hit.
[2023-03-15 00:32:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 4707 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-07
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 00:32:59] [INFO ] Computed 8 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 1475 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-15 00:32:59] [INFO ] Invariant cache hit.
[2023-03-15 00:32:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 00:32:59] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:59] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-15 00:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:32:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:32:59] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 00:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:32:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-15 00:32:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:32:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2023-03-15 00:32:59] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 00:32:59] [INFO ] Added : 40 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 44 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 44 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 43 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 42 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 39
Applied a total of 11 rules in 11 ms. Remains 41 /48 variables (removed 7) and now considering 39/44 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 41/48 places, 39/44 transitions.
// Phase 1: matrix 39 rows 41 cols
[2023-03-15 00:32:59] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 144196 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91846 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
[2023-03-15 00:33:01] [INFO ] Invariant cache hit.
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 00:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 00:33:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:33:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:33:01] [INFO ] Computed and/alt/rep : 38/161/38 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 00:33:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2023-03-15 00:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-15 00:33:01] [INFO ] Added : 34 causal constraints over 7 iterations in 88 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-15 00:33:01] [INFO ] Invariant cache hit.
[2023-03-15 00:33:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-15 00:33:01] [INFO ] Invariant cache hit.
[2023-03-15 00:33:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:33:01] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-15 00:33:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 00:33:01] [INFO ] Invariant cache hit.
[2023-03-15 00:33:01] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 41/41 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-07 in 2599 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-10
// Phase 1: matrix 44 rows 48 cols
[2023-03-15 00:33:01] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 00:33:01] [INFO ] Invariant cache hit.
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-15 00:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 00:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:01] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-15 00:33:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:33:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:33:01] [INFO ] Computed and/alt/rep : 43/160/43 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 00:33:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-15 00:33:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-15 00:33:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-15 00:33:02] [INFO ] Added : 33 causal constraints over 7 iterations in 169 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Graph (complete) has 142 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 43 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 43 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 38
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 40 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 39 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 39 transition count 37
Applied a total of 15 rules in 11 ms. Remains 39 /48 variables (removed 9) and now considering 37/44 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 39/48 places, 37/44 transitions.
// Phase 1: matrix 37 rows 39 cols
[2023-03-15 00:33:02] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 144385 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91687 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
[2023-03-15 00:33:03] [INFO ] Invariant cache hit.
[2023-03-15 00:33:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:33:03] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 00:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 00:33:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 00:33:03] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 00:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 00:33:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 00:33:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:33:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-15 00:33:03] [INFO ] Computed and/alt/rep : 36/163/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 00:33:03] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2023-03-15 00:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-15 00:33:03] [INFO ] Added : 33 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/39 places, 37/37 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2023-03-15 00:33:03] [INFO ] Invariant cache hit.
[2023-03-15 00:33:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-15 00:33:04] [INFO ] Invariant cache hit.
[2023-03-15 00:33:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-15 00:33:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-15 00:33:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 00:33:04] [INFO ] Invariant cache hit.
[2023-03-15 00:33:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 39/39 places, 37/37 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-10 in 2331 ms.
[2023-03-15 00:33:04] [INFO ] Flatten gal took : 58 ms
[2023-03-15 00:33:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-15 00:33:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 44 transitions and 192 arcs took 2 ms.
Total runtime 47723 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DoubleExponent_PT_002
(NrP: 48 NrTr: 44 NrArc: 192)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.604sec


RS generation: 0m 0.040sec


-> reachability set: #nodes 1414 (1.4e+03) #states 1,210 (3)



starting MCC model checker
--------------------------

checking: place_bound(p5)
normalized: place_bound(p5)

-> the formula is 16

FORMULA DoubleExponent-PT-002-UpperBounds-00 16 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p27)
normalized: place_bound(p27)

-> the formula is 4

FORMULA DoubleExponent-PT-002-UpperBounds-01 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p32)
normalized: place_bound(p32)

-> the formula is 1

FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p4)
normalized: place_bound(p4)

-> the formula is 1

FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p40)
normalized: place_bound(p40)

-> the formula is 1

FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 11445 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 39709 112941 152650
used/not used/entry size/cache size: 119762 66989102 16 1024MB
basic ops cache: hits/miss/sum: 170 2289 2459
used/not used/entry size/cache size: 5902 16771314 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 270 1414 1684
used/not used/entry size/cache size: 1414 8387194 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67097913
1 10861
2 58
3 4
4 1
5 6
6 0
7 0
8 0
9 1
>= 10 20

Total processing time: 0m 5.290sec


BK_STOP 1678840390887

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:3301 (75), effective:325 (7)

initing FirstDep: 0m 0.000sec

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-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DoubleExponent-PT-002, 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 r138-smll-167819420700453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;