Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109900165.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109900165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 17K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652638103535

Running Version 202205111006
[2022-05-15 18:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:08:24] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2022-05-15 18:08:24] [INFO ] Transformed 57 places.
[2022-05-15 18:08:24] [INFO ] Transformed 48 transitions.
[2022-05-15 18:08:24] [INFO ] Parsed PT model containing 57 places and 48 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 48 rows 57 cols
[2022-05-15 18:08:24] [INFO ] Computed 9 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 343 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :24
FORMULA DoubleExponent-PT-001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :8
// Phase 1: matrix 48 rows 57 cols
[2022-05-15 18:08:24] [INFO ] Computed 9 place invariants in 13 ms
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-15 18:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:08:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2022-05-15 18:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-15 18:08:25] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-15 18:08:25] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2022-05-15 18:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-15 18:08:25] [INFO ] Added : 45 causal constraints over 9 iterations in 130 ms. Result :sat
Minimization took 46 ms.
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 18:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:25] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-15 18:08:25] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-05-15 18:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-15 18:08:25] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-15 18:08:25] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-05-15 18:08:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-15 18:08:25] [INFO ] Added : 45 causal constraints over 9 iterations in 128 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 52 transition count 36
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 42 transition count 36
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 24 place count 42 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 38 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 37 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 37 transition count 31
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 58 place count 25 transition count 19
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 25 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 23 transition count 17
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 65 place count 23 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 22 transition count 16
Applied a total of 66 rules in 27 ms. Remains 22 /57 variables (removed 35) and now considering 16/48 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/57 places, 16/48 transitions.
// Phase 1: matrix 16 rows 22 cols
[2022-05-15 18:08:26] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 97593 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 70094 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 70453 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 2) seen :8
// Phase 1: matrix 16 rows 22 cols
[2022-05-15 18:08:27] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 18:08:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:08:27] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2022-05-15 18:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-15 18:08:27] [INFO ] Computed and/alt/rep : 15/43/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:27] [INFO ] Added : 14 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 10 ms.
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 18:08:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-15 18:08:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2022-05-15 18:08:27] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2022-05-15 18:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-15 18:08:27] [INFO ] Computed and/alt/rep : 15/43/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:27] [INFO ] Added : 14 causal constraints over 4 iterations in 13 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2022-05-15 18:08:27] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 18:08:27] [INFO ] Implicit Places using invariants in 31 ms returned [7, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 20/22 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 15
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 18 transition count 14
Applied a total of 4 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:27] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 18/22 places, 14/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/22 places, 14/16 transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:27] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 105659 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000000 steps, including 73900 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 74360 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 2) seen :18
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:28] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 18:08:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:28] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:28] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 18:08:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:28] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 41 ms
[2022-05-15 18:08:29] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-15 18:08:29] [INFO ] Added : 12 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 7 ms.
[2022-05-15 18:08:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:29] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:29] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 87 ms
[2022-05-15 18:08:29] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:29] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-15 18:08:29] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[10, 10]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 14/14 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:29] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-15 18:08:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 14/14 transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:29] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 105251 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000000 steps, including 74233 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 2) seen :16
Incomplete Best-First random walk after 1000000 steps, including 74210 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 2) seen :18
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 18:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-15 18:08:30] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-15 18:08:30] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 8 ms.
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 18:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 85 ms
[2022-05-15 18:08:30] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:30] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2022-05-15 18:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-15 18:08:30] [INFO ] Added : 12 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[10, 10]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 14/14 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:30] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 18:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-15 18:08:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 18:08:30] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 14/14 transitions.
Starting property specific reduction for DoubleExponent-PT-001-UpperBounds-01
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1038 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 754 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :6
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-15 18:08:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 87 ms
[2022-05-15 18:08:31] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2022-05-15 18:08:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 51 ms
[2022-05-15 18:08:31] [INFO ] Added : 12 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Graph (complete) has 44 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 13
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 16 transition count 13
Applied a total of 3 rules in 4 ms. Remains 16 /18 variables (removed 2) and now considering 13/14 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/18 places, 13/14 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:31] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 126706 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000000 steps, including 84320 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :8
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:31] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:31] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 18:08:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-15 18:08:32] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 18:08:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2022-05-15 18:08:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2022-05-15 18:08:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2022-05-15 18:08:32] [INFO ] Added : 11 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[11]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:32] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-15 18:08:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:32] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 126896 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 84042 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :9
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 18:08:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-15 18:08:33] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2022-05-15 18:08:33] [INFO ] Added : 11 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[11]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:33] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-15 18:08:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:33] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Ending property specific reduction for DoubleExponent-PT-001-UpperBounds-01 in 2245 ms.
Starting property specific reduction for DoubleExponent-PT-001-UpperBounds-05
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:33] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1039 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 774 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :6
// Phase 1: matrix 14 rows 18 cols
[2022-05-15 18:08:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 18:08:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:33] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 18:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:33] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 18:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 43 ms
[2022-05-15 18:08:33] [INFO ] Computed and/alt/rep : 13/31/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 18:08:33] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-05-15 18:08:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-15 18:08:33] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18/18 places, 14/14 transitions.
Graph (complete) has 44 edges and 18 vertex of which 17 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 16 transition count 13
Applied a total of 3 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 13/14 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/18 places, 13/14 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 127306 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 83966 resets, run finished after 305 ms. (steps per millisecond=3278 ) properties (out of 1) seen :10
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-15 18:08:34] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2022-05-15 18:08:34] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2022-05-15 18:08:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2022-05-15 18:08:34] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 18:08:34] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:34] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-15 18:08:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 127160 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000000 steps, including 84027 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 1) seen :10
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:34] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 18:08:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 18:08:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 18:08:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 18:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 18:08:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-15 18:08:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-15 18:08:35] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-05-15 18:08:35] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2022-05-15 18:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2022-05-15 18:08:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 18:08:35] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:35] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 18:08:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 18:08:35] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-15 18:08:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2022-05-15 18:08:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 18:08:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 13/13 transitions.
Ending property specific reduction for DoubleExponent-PT-001-UpperBounds-05 in 2058 ms.
[2022-05-15 18:08:35] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:08:35] [INFO ] Applying decomposition
[2022-05-15 18:08:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16530706247168075182.txt' '-o' '/tmp/graph16530706247168075182.bin' '-w' '/tmp/graph16530706247168075182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16530706247168075182.bin' '-l' '-1' '-v' '-w' '/tmp/graph16530706247168075182.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:08:35] [INFO ] Decomposing Gal with order
[2022-05-15 18:08:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:08:35] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-15 18:08:35] [INFO ] Flatten gal took : 28 ms
[2022-05-15 18:08:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 18:08:35] [INFO ] Time to serialize gal into /tmp/UpperBounds13252500722667681127.gal : 2 ms
[2022-05-15 18:08:35] [INFO ] Time to serialize properties into /tmp/UpperBounds3161381272357174727.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13252500722667681127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3161381272357174727.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds3161381272357174727.prop.
Detected timeout of ITS tools.
[2022-05-15 18:28:38] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:28:38] [INFO ] Time to serialize gal into /tmp/UpperBounds3460867023252679827.gal : 0 ms
[2022-05-15 18:28:38] [INFO ] Time to serialize properties into /tmp/UpperBounds472176738584981881.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3460867023252679827.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds472176738584981881.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...294
Loading property file /tmp/UpperBounds472176738584981881.prop.
Detected timeout of ITS tools.
[2022-05-15 18:48:41] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:48:41] [INFO ] Input system was already deterministic with 14 transitions.
[2022-05-15 18:48:41] [INFO ] Transformed 18 places.
[2022-05-15 18:48:41] [INFO ] Transformed 14 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 18:48:41] [INFO ] Time to serialize gal into /tmp/UpperBounds4535935611554459137.gal : 0 ms
[2022-05-15 18:48:41] [INFO ] Time to serialize properties into /tmp/UpperBounds14847948353813102415.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4535935611554459137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14847948353813102415.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109900165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;