Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602800181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-a008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602800181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 11 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717187304139

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:28:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:28:25] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 20:28:25] [INFO ] Transformed 40 places.
[2024-05-31 20:28:25] [INFO ] Transformed 70 transitions.
[2024-05-31 20:28:25] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:28:25] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-31 20:28:25] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 0] Max Struct:[8, 8, +inf, 1, +inf, +inf, 1, 1, +inf, +inf, 1, 8, +inf]
FORMULA FunctionPointer-PT-a008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10005 steps (31 resets) in 30 ms. (322 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (22 resets) in 63 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 71, 28, 12, 6, 53] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:28:25] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:28:25] [INFO ] Invariant cache hit.
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:28:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:25] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:25] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 8 ms to minimize.
[2024-05-31 20:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:28:25] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:28:25] [INFO ] Added : 20 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:28:25] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 20:28:26] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:28:26] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 20:28:26] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:28:26] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:26] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 20:28:26] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:28:26] [INFO ] Added : 19 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-31 20:28:26] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:28:26] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 20:28:26] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:28:26] [INFO ] Added : 18 causal constraints over 6 iterations in 36 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 71, 28, 12, 6, 53] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 71, 28, 19, 11, 53] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 31 transition count 63
Applied a total of 4 rules in 21 ms. Remains 31 /34 variables (removed 3) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 31/34 places, 63/66 transitions.
[2024-05-31 20:28:27] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :[9, 6, 6, 9, 3, 13]
Current structural bounds on expressions (after cover walk) : Max Seen:[12, 71, 28, 19, 11, 53] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:28:27] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-31 20:28:27] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12, 71, 28, 19, 11, 53] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 795 ms. (1256 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2063 ms. (2906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 6728, 3085, 19, 1056, 3702] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:28:30] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:30] [INFO ] Invariant cache hit.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 20:28:30] [INFO ] Added : 20 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 0 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-31 20:28:30] [INFO ] Added : 4 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:30] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:30] [INFO ] Added : 19 causal constraints over 6 iterations in 31 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-31 20:28:30] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:30] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 20:28:30] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:30] [INFO ] Added : 15 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 6728, 3085, 19, 1056, 3702] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 6728, 3085, 19, 1056, 3702] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 31/31 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:28:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:41] [INFO ] Invariant cache hit.
[2024-05-31 20:28:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 20:28:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:41] [INFO ] Invariant cache hit.
[2024-05-31 20:28:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:41] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-31 20:28:41] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-31 20:28:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:41] [INFO ] Invariant cache hit.
[2024-05-31 20:28:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 0 solved, 61 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1355 ms. Remains : 31/31 places, 63/63 transitions.
[2024-05-31 20:28:42] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :[9, 4, 2147483647, 7, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 6728, +inf, 19, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:28:43] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 6728, +inf, 19, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 776 ms. (1287 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000002 steps (6 resets) in 927 ms. (3232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 7293, 19] Max Struct:[+inf, +inf, +inf]
[2024-05-31 20:28:44] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:44] [INFO ] Invariant cache hit.
[2024-05-31 20:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:44] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 20:28:44] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:44] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 20:28:44] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 13 ms.
[2024-05-31 20:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:28:44] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:45] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:45] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 20:28:45] [INFO ] Added : 4 causal constraints over 2 iterations in 50 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:28:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 20:28:45] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:45] [INFO ] Added : 19 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 7293, 19] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 31/31 places, 63/63 transitions.
[2024-05-31 20:28:47] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :[8, 7, 12]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
[2024-05-31 20:28:47] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 716 ms. (1394 steps per ms)
BEST_FIRST walk for 3000001 steps (6 resets) in 894 ms. (3351 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
[2024-05-31 20:28:49] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:49] [INFO ] Invariant cache hit.
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:28:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:49] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-31 20:28:49] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-31 20:28:49] [INFO ] Added : 20 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Real]Added 8 Read/Feed constraints in 0 ms returned sat
[2024-05-31 20:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 20:28:49] [INFO ] Added : 4 causal constraints over 2 iterations in 50 ms. Result :sat
Minimization took 8 ms.
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:28:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:28:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 20:28:49] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:28:49] [INFO ] Added : 19 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 31/31 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-31 20:28:52] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:52] [INFO ] Invariant cache hit.
[2024-05-31 20:28:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 20:28:52] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:52] [INFO ] Invariant cache hit.
[2024-05-31 20:28:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:28:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-31 20:28:52] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-31 20:28:52] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:52] [INFO ] Invariant cache hit.
[2024-05-31 20:28:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 0 solved, 61 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 103 constraints, problems are : Problem set: 0 solved, 61 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1145ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1247 ms. Remains : 31/31 places, 63/63 transitions.
[2024-05-31 20:28:53] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :[8, 6, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40005 steps (8 resets) in 532 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 623016 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 3
Probabilistic random walk after 623016 steps, saw 416283 distinct states, run finished after 3003 ms. (steps per millisecond=207 ) properties seen :0
[2024-05-31 20:28:56] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:28:56] [INFO ] Invariant cache hit.
[2024-05-31 20:28:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/46 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/70 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/75 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 0 solved, 3 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/40 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 24/70 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 5/75 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/75 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/75 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 45 constraints, problems are : Problem set: 0 solved, 3 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 31/31 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 6321 ms.
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 59
Applied a total of 4 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 30/31 places, 59/63 transitions.
RANDOM walk for 40012 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2934084 steps, run timeout after 3001 ms. (steps per millisecond=977 ) properties seen :0 out of 1
Probabilistic random walk after 2934084 steps, saw 1983987 distinct states, run finished after 3001 ms. (steps per millisecond=977 ) properties seen :0
[2024-05-31 20:29:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-31 20:29:06] [INFO ] Computed 3 invariants in 6 ms
[2024-05-31 20:29:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 493 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=246 )
Parikh walk visited 1 properties in 5 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[14, 7294, 19] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-a008-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:29:06] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-31 20:29:06] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 20:29:06] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:29:06] [INFO ] Invariant cache hit.
[2024-05-31 20:29:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:29:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:06] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:29:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:29:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:29:06] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:29:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 20:29:06] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
[2024-05-31 20:29:06] [INFO ] Added : 20 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 59
Applied a total of 4 rules in 6 ms. Remains 30 /31 variables (removed 1) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 30/31 places, 59/63 transitions.
[2024-05-31 20:29:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 20:29:06] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-31 20:29:06] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 1000008 steps (2 resets) in 647 ms. (1543 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 340 ms. (2932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[+inf]
[2024-05-31 20:29:07] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:07] [INFO ] Invariant cache hit.
[2024-05-31 20:29:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:29:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:07] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:29:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-31 20:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 74 ms
[2024-05-31 20:29:07] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:29:07] [INFO ] Added : 22 causal constraints over 6 iterations in 31 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:29:07] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:07] [INFO ] Invariant cache hit.
[2024-05-31 20:29:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 20:29:08] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:08] [INFO ] Invariant cache hit.
[2024-05-31 20:29:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 20:29:08] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:29:08] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:08] [INFO ] Invariant cache hit.
[2024-05-31 20:29:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 986ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:29:09] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[13] Max Struct:[+inf]
[2024-05-31 20:29:09] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 633 ms. (1577 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 330 ms. (3021 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[+inf]
[2024-05-31 20:29:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:10] [INFO ] Invariant cache hit.
[2024-05-31 20:29:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:29:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:10] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 20:29:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:10] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:29:10] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:29:10] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-31 20:29:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 84 ms
[2024-05-31 20:29:10] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-31 20:29:10] [INFO ] Added : 22 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:29:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:10] [INFO ] Invariant cache hit.
[2024-05-31 20:29:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 20:29:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:10] [INFO ] Invariant cache hit.
[2024-05-31 20:29:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:10] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-31 20:29:10] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:29:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:10] [INFO ] Invariant cache hit.
[2024-05-31 20:29:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1014 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:29:11] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[13] Max Struct:[+inf]
RANDOM walk for 40008 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2935761 steps, run timeout after 3001 ms. (steps per millisecond=978 ) properties seen :0 out of 1
Probabilistic random walk after 2935761 steps, saw 1985161 distinct states, run finished after 3001 ms. (steps per millisecond=978 ) properties seen :0
[2024-05-31 20:29:14] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:14] [INFO ] Invariant cache hit.
[2024-05-31 20:29:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 153 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=153 )
Parikh walk visited 1 properties in 1 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[13] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a008-UpperBounds-02 in 7970 ms.
Starting property specific reduction for FunctionPointer-PT-a008-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:29:14] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-31 20:29:14] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 74 ms. (133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[66] Max Struct:[+inf]
[2024-05-31 20:29:14] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:29:14] [INFO ] Invariant cache hit.
[2024-05-31 20:29:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:29:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:14] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:29:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:14] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-31 20:29:14] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 20:29:14] [INFO ] Added : 4 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[66] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[68] Max Struct:[+inf]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Graph (complete) has 110 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 28 transition count 58
Applied a total of 6 rules in 3 ms. Remains 28 /31 variables (removed 3) and now considering 58/63 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 28/31 places, 58/63 transitions.
[2024-05-31 20:29:14] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 6=1, 20=1, 30=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 20=1, 30=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:29:14] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
// Phase 1: matrix 41 rows 28 cols
[2024-05-31 20:29:14] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 742 ms. (1345 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-a008-UpperBounds-04 in 1036 ms.
Starting property specific reduction for FunctionPointer-PT-a008-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:29:15] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-31 20:29:15] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-31 20:29:15] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:29:15] [INFO ] Invariant cache hit.
[2024-05-31 20:29:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:29:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:15] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:29:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:29:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:29:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-31 20:29:15] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-31 20:29:15] [INFO ] Added : 19 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 59
Applied a total of 4 rules in 5 ms. Remains 30 /31 variables (removed 1) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/31 places, 59/63 transitions.
[2024-05-31 20:29:15] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[13] Max Struct:[+inf]
[2024-05-31 20:29:15] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-31 20:29:15] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 639 ms. (1562 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 395 ms. (2525 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13] Max Struct:[+inf]
[2024-05-31 20:29:16] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:16] [INFO ] Invariant cache hit.
[2024-05-31 20:29:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 20:29:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:16] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:29:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:29:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:29:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:29:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:29:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-31 20:29:16] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 2 ms.
[2024-05-31 20:29:16] [INFO ] Added : 20 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:29:16] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:16] [INFO ] Invariant cache hit.
[2024-05-31 20:29:16] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 20:29:16] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:16] [INFO ] Invariant cache hit.
[2024-05-31 20:29:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:29:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-31 20:29:17] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:29:17] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:17] [INFO ] Invariant cache hit.
[2024-05-31 20:29:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 914ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1008 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:29:17] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[13] Max Struct:[+inf]
RANDOM walk for 40011 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2977001 steps, run timeout after 3001 ms. (steps per millisecond=992 ) properties seen :0 out of 1
Probabilistic random walk after 2977001 steps, saw 2014028 distinct states, run finished after 3001 ms. (steps per millisecond=992 ) properties seen :0
[2024-05-31 20:29:21] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:29:21] [INFO ] Invariant cache hit.
[2024-05-31 20:29:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[13] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a008-UpperBounds-10 in 5578 ms.
[2024-05-31 20:29:21] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:29:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 20:29:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 63 transitions and 254 arcs took 3 ms.
Total runtime 56024 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-a008-UpperBounds-02
Could not compute solution for formula : FunctionPointer-PT-a008-UpperBounds-10

BK_STOP 1717187361481

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FunctionPointer-PT-a008-UpperBounds-02
ub formula formula --maxsum=/tmp/915/ub_0_
ub formula name FunctionPointer-PT-a008-UpperBounds-10
ub formula formula --maxsum=/tmp/915/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FunctionPointer-PT-a008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-a008, 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 r496-tall-171640602800181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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