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.r294-smll-165463872300005.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 CANInsertWithFailure-PT-005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K May 30 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 30 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 30 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 30 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 30 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K May 30 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 202K May 29 12:20 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 CANInsertWithFailure-PT-005-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654639630680

Running Version 202205111006
[2022-06-07 22:07:13] [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-06-07 22:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-07 22:07:13] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2022-06-07 22:07:13] [INFO ] Transformed 114 places.
[2022-06-07 22:07:13] [INFO ] Transformed 180 transitions.
[2022-06-07 22:07:13] [INFO ] Parsed PT model containing 114 places and 180 transitions in 451 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 180 rows 114 cols
[2022-06-07 22:07:13] [INFO ] Computed 8 place invariants in 37 ms
FORMULA CANInsertWithFailure-PT-005-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 98 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 15) seen :25
FORMULA CANInsertWithFailure-PT-005-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :10
// Phase 1: matrix 180 rows 114 cols
[2022-06-07 22:07:13] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-07 22:07:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:14] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-07 22:07:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:07:14] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned unsat
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:14] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-06-07 22:07:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Added 45 Read/Feed constraints in 29 ms returned sat
[2022-06-07 22:07:15] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 33 ms.
[2022-06-07 22:07:15] [INFO ] Added : 51 causal constraints over 11 iterations in 329 ms. Result :sat
Minimization took 66 ms.
[2022-06-07 22:07:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 17 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:15] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-06-07 22:07:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:15] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned unsat
[2022-06-07 22:07:15] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:16] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-07 22:07:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2022-06-07 22:07:16] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-07 22:07:16] [INFO ] Added : 38 causal constraints over 8 iterations in 196 ms. Result :sat
Minimization took 79 ms.
[2022-06-07 22:07:16] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:16] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-06-07 22:07:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:16] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-06-07 22:07:16] [INFO ] [Nat]Added 45 Read/Feed constraints in 30 ms returned sat
[2022-06-07 22:07:16] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 20 ms.
[2022-06-07 22:07:17] [INFO ] Added : 49 causal constraints over 10 iterations in 240 ms. Result :sat
Minimization took 80 ms.
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-06-07 22:07:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:17] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Nat]Added 45 Read/Feed constraints in 25 ms returned sat
[2022-06-07 22:07:17] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 22 ms.
[2022-06-07 22:07:17] [INFO ] Added : 37 causal constraints over 8 iterations in 192 ms. Result :sat
Minimization took 74 ms.
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:17] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-06-07 22:07:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:18] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Added 45 Read/Feed constraints in 21 ms returned sat
[2022-06-07 22:07:18] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 28 ms.
[2022-06-07 22:07:18] [INFO ] Added : 48 causal constraints over 10 iterations in 225 ms. Result :sat
Minimization took 79 ms.
[2022-06-07 22:07:18] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:18] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-07 22:07:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:18] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-06-07 22:07:18] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2022-06-07 22:07:18] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 21 ms.
[2022-06-07 22:07:18] [INFO ] Added : 38 causal constraints over 8 iterations in 176 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [4, 5, 4, 5, 5, 5, 5, 5] Max seen :[4, 1, 4, 1, 1, 1, 1, 1]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 78 transition count 145
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 93 place count 67 transition count 134
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 67 transition count 129
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 2 with 46 rules applied. Total rules applied 144 place count 67 transition count 129
Applied a total of 144 rules in 82 ms. Remains 67 /114 variables (removed 47) and now considering 129/180 (removed 51) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/114 places, 129/180 transitions.
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:19] [INFO ] Computed 7 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 27423 resets, run finished after 1996 ms. (steps per millisecond=501 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5291 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5912 resets, run finished after 453 ms. (steps per millisecond=2207 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5551 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4985 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5209 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5956 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 6) seen :6
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:24] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-07 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-07 22:07:24] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:24] [INFO ] [Nat]Added 99 Read/Feed constraints in 14 ms returned sat
[2022-06-07 22:07:24] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 12 ms.
[2022-06-07 22:07:24] [INFO ] Added : 16 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 36 ms.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-07 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Added 99 Read/Feed constraints in 16 ms returned sat
[2022-06-07 22:07:24] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 18 ms.
[2022-06-07 22:07:24] [INFO ] Added : 7 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 33 ms.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-07 22:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:24] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Nat]Added 99 Read/Feed constraints in 17 ms returned sat
[2022-06-07 22:07:24] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 17 ms.
[2022-06-07 22:07:24] [INFO ] Added : 8 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 33 ms.
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-06-07 22:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Added 99 Read/Feed constraints in 22 ms returned sat
[2022-06-07 22:07:25] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 14 ms.
[2022-06-07 22:07:25] [INFO ] Added : 17 causal constraints over 4 iterations in 90 ms. Result :sat
Minimization took 59 ms.
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-07 22:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Added 99 Read/Feed constraints in 12 ms returned sat
[2022-06-07 22:07:25] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 13 ms.
[2022-06-07 22:07:25] [INFO ] Added : 13 causal constraints over 3 iterations in 77 ms. Result :sat
Minimization took 35 ms.
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-07 22:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:25] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-07 22:07:25] [INFO ] [Nat]Added 99 Read/Feed constraints in 14 ms returned sat
[2022-06-07 22:07:25] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 12 ms.
[2022-06-07 22:07:25] [INFO ] Added : 27 causal constraints over 7 iterations in 119 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5] Max seen :[1, 1, 1, 1, 1, 1]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 129/129 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:25] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:26] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:26] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-07 22:07:26] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:26] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-06-07 22:07:26] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:26] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:26] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 129/129 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-02
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:26] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 278 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:26] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:26] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:26] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-06-07 22:07:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:26] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:26] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-06-07 22:07:26] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:26] [INFO ] [Nat]Added 99 Read/Feed constraints in 20 ms returned sat
[2022-06-07 22:07:26] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 13 ms.
[2022-06-07 22:07:26] [INFO ] Added : 16 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 64 transition count 126
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 64 transition count 126
Applied a total of 8 rules in 20 ms. Remains 64 /67 variables (removed 3) and now considering 126/129 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 126/129 transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:26] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29173 resets, run finished after 1511 ms. (steps per millisecond=661 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 5623 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 1) seen :1
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:28] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-07 22:07:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:28] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:28] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-07 22:07:28] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-07 22:07:28] [INFO ] [Nat]Added 103 Read/Feed constraints in 13 ms returned sat
[2022-06-07 22:07:28] [INFO ] Computed and/alt/rep : 96/291/96 causal constraints (skipped 25 transitions) in 11 ms.
[2022-06-07 22:07:29] [INFO ] Added : 8 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:29] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:29] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-07 22:07:29] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2022-06-07 22:07:29] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-02 in 3139 ms.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-10
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 281 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:29] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:29] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-06-07 22:07:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:29] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:29] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-06-07 22:07:29] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:29] [INFO ] [Nat]Added 99 Read/Feed constraints in 16 ms returned sat
[2022-06-07 22:07:29] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 16 ms.
[2022-06-07 22:07:29] [INFO ] Added : 7 causal constraints over 2 iterations in 57 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 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 2 place count 66 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 127
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 65 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 64 transition count 126
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 64 transition count 126
Applied a total of 10 rules in 41 ms. Remains 64 /67 variables (removed 3) and now considering 126/129 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 126/129 transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:29] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 28214 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 6125 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 1) seen :1
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:31] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:31] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:31] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-07 22:07:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:31] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:32] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-07 22:07:32] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-07 22:07:32] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2022-06-07 22:07:32] [INFO ] Computed and/alt/rep : 96/273/96 causal constraints (skipped 25 transitions) in 11 ms.
[2022-06-07 22:07:32] [INFO ] Added : 8 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:32] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:32] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-07 22:07:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-06-07 22:07:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:32] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-10 in 2953 ms.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-11
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 266 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:32] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:32] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-07 22:07:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:32] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:32] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-07 22:07:32] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:32] [INFO ] [Nat]Added 99 Read/Feed constraints in 15 ms returned sat
[2022-06-07 22:07:32] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 9 ms.
[2022-06-07 22:07:32] [INFO ] Added : 8 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 65 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 63 transition count 125
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 63 transition count 125
Applied a total of 11 rules in 24 ms. Remains 63 /67 variables (removed 4) and now considering 125/129 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 125/129 transitions.
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:32] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 28853 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 5782 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 1) seen :1
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:34] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:07:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:34] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-06-07 22:07:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:34] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:34] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-06-07 22:07:34] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-06-07 22:07:34] [INFO ] [Nat]Added 104 Read/Feed constraints in 20 ms returned sat
[2022-06-07 22:07:34] [INFO ] Computed and/alt/rep : 95/290/95 causal constraints (skipped 25 transitions) in 17 ms.
[2022-06-07 22:07:34] [INFO ] Added : 9 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 125/125 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:34] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:07:35] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:35] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-06-07 22:07:35] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2022-06-07 22:07:35] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:35] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:07:35] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 125/125 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-11 in 2917 ms.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-12
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:35] [INFO ] Computed 7 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 272 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:35] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:35] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:35] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:35] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-06-07 22:07:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:35] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-07 22:07:35] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:35] [INFO ] [Nat]Added 99 Read/Feed constraints in 17 ms returned sat
[2022-06-07 22:07:35] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 13 ms.
[2022-06-07 22:07:35] [INFO ] Added : 17 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 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 2 place count 66 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 127
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 65 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 63 transition count 125
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 63 transition count 125
Applied a total of 11 rules in 20 ms. Remains 63 /67 variables (removed 4) and now considering 125/129 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/67 places, 125/129 transitions.
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:35] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 28868 resets, run finished after 1516 ms. (steps per millisecond=659 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 5276 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 1) seen :1
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:07:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:37] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:37] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-07 22:07:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:37] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-07 22:07:37] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-06-07 22:07:37] [INFO ] [Nat]Added 104 Read/Feed constraints in 14 ms returned sat
[2022-06-07 22:07:37] [INFO ] Computed and/alt/rep : 95/290/95 causal constraints (skipped 25 transitions) in 12 ms.
[2022-06-07 22:07:38] [INFO ] Added : 8 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 125/125 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:38] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:38] [INFO ] State equation strengthened by 104 read => feed constraints.
[2022-06-07 22:07:38] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2022-06-07 22:07:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 63 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:07:38] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 125/125 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-12 in 3052 ms.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-13
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 267 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:38] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:38] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-06-07 22:07:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:38] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:38] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-06-07 22:07:38] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:38] [INFO ] [Nat]Added 99 Read/Feed constraints in 17 ms returned sat
[2022-06-07 22:07:38] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 10 ms.
[2022-06-07 22:07:38] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 66 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 64 transition count 126
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 64 transition count 126
Applied a total of 10 rules in 15 ms. Remains 64 /67 variables (removed 3) and now considering 126/129 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 126/129 transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:38] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 28532 resets, run finished after 1271 ms. (steps per millisecond=786 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 5369 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 1) seen :1
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:40] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-07 22:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:40] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-07 22:07:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:40] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:40] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-06-07 22:07:40] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-07 22:07:40] [INFO ] [Nat]Added 103 Read/Feed constraints in 19 ms returned sat
[2022-06-07 22:07:40] [INFO ] Computed and/alt/rep : 96/281/96 causal constraints (skipped 25 transitions) in 13 ms.
[2022-06-07 22:07:40] [INFO ] Added : 12 causal constraints over 3 iterations in 76 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:40] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:40] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:41] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:07:41] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-07 22:07:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-06-07 22:07:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:41] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-07 22:07:41] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-13 in 2801 ms.
Starting property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-15
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:41] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 272 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
// Phase 1: matrix 129 rows 67 cols
[2022-06-07 22:07:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-07 22:07:41] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:41] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-07 22:07:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:41] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-07 22:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:41] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-06-07 22:07:41] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-06-07 22:07:41] [INFO ] [Nat]Added 99 Read/Feed constraints in 20 ms returned sat
[2022-06-07 22:07:41] [INFO ] Computed and/alt/rep : 99/251/99 causal constraints (skipped 25 transitions) in 14 ms.
[2022-06-07 22:07:41] [INFO ] Added : 27 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 129/129 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 2 place count 66 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 66 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 127
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 65 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 64 transition count 126
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 64 transition count 126
Applied a total of 10 rules in 27 ms. Remains 64 /67 variables (removed 3) and now considering 126/129 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/67 places, 126/129 transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:41] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 28327 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 6167 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 1) seen :1
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:07:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-07 22:07:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-07 22:07:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-07 22:07:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-07 22:07:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-07 22:07:43] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-06-07 22:07:43] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-07 22:07:43] [INFO ] [Nat]Added 105 Read/Feed constraints in 19 ms returned sat
[2022-06-07 22:07:43] [INFO ] Computed and/alt/rep : 96/270/96 causal constraints (skipped 25 transitions) in 13 ms.
[2022-06-07 22:07:43] [INFO ] Added : 11 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:43] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:43] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-07 22:07:44] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2022-06-07 22:07:44] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 126 rows 64 cols
[2022-06-07 22:07:44] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:07:44] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 126/126 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-005-UpperBounds-15 in 3043 ms.
[2022-06-07 22:07:44] [INFO ] Flatten gal took : 59 ms
[2022-06-07 22:07:44] [INFO ] Applying decomposition
[2022-06-07 22:07:44] [INFO ] Flatten gal took : 24 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/graph12090629935956655668.txt' '-o' '/tmp/graph12090629935956655668.bin' '-w' '/tmp/graph12090629935956655668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12090629935956655668.bin' '-l' '-1' '-v' '-w' '/tmp/graph12090629935956655668.weights' '-q' '0' '-e' '0.001'
[2022-06-07 22:07:44] [INFO ] Decomposing Gal with order
[2022-06-07 22:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-07 22:07:44] [INFO ] Removed a total of 99 redundant transitions.
[2022-06-07 22:07:44] [INFO ] Flatten gal took : 74 ms
[2022-06-07 22:07:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 10 ms.
[2022-06-07 22:07:44] [INFO ] Time to serialize gal into /tmp/UpperBounds2350890776191056860.gal : 15 ms
[2022-06-07 22:07:44] [INFO ] Time to serialize properties into /tmp/UpperBounds17555318119361726119.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2350890776191056860.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17555318119361726119.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/UpperBounds17555318119361726119.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,13181,0.330413,12448,774,226,15613,1217,406,29485,124,6683,0
Total reachable state count : 13181

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-02 :0 <= i0.u12.Node2GiveAnswer4 <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-02,0,0.34612,12448,1,0,15613,1217,489,29485,142,6683,335
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-10 :0 <= i3.u6.Node2OKshare <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-10,0,0.348357,12448,1,0,15613,1217,513,29485,151,6683,395
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-11 :0 <= i1.u11.Node1requestsent4 <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-11,0,0.349115,12448,1,0,15613,1217,527,29485,156,6683,472
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-12 :0 <= i1.u2.Node0requestsent3 <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-12,0,0.349706,12448,1,0,15613,1217,541,29485,161,6683,528
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-13 :0 <= i1.u11.Node1GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-13,0,0.350617,12448,1,0,15613,1217,555,29485,165,6683,603
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-005-UpperBounds-15 :0 <= i2.u4.Node1OKshare <= 1
FORMULA CANInsertWithFailure-PT-005-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-005-UpperBounds-15,0,0.352328,12448,1,0,15613,1217,568,29485,165,6683,647
Total runtime 32259 ms.

BK_STOP 1654639665418

--------------------
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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r294-smll-165463872300005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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