fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r165-tall-167838850700629
Last Updated
May 14, 2023

About the Execution of ITS-Tools for FunctionPointer-PT-a016

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16202.096 3600000.00 3665508.00 14916.30 ? 1 0 0 1 16 16 0 16 1 0 16 1 1 ? ? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679528524719

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a016
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 23:42:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 23:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:42:06] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-22 23:42:06] [INFO ] Transformed 40 places.
[2023-03-22 23:42:06] [INFO ] Transformed 70 transitions.
[2023-03-22 23:42:06] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 46 out of 66 initially.
// Phase 1: matrix 46 rows 34 cols
[2023-03-22 23:42:06] [INFO ] Computed 4 place invariants in 8 ms
FORMULA FunctionPointer-PT-a016-UpperBounds-06 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :78
FORMULA FunctionPointer-PT-a016-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-11 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :37
FORMULA FunctionPointer-PT-a016-UpperBounds-05 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :193
[2023-03-22 23:42:06] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-22 23:42:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 23:42:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 23:42:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 23:42:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:06] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 23:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 23:42:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-22 23:42:06] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
[2023-03-22 23:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-22 23:42:06] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2023-03-22 23:42:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2023-03-22 23:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-22 23:42:06] [INFO ] Added : 19 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 23:42:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-22 23:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-22 23:42:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2023-03-22 23:42:07] [INFO ] Added : 18 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 23:42:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:42:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 23:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 23:42:07] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2023-03-22 23:42:07] [INFO ] Added : 18 causal constraints over 6 iterations in 30 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[21, 6, 186]
Support contains 3 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 19 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 30/34 places, 60/66 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:07] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000002 steps, including 2794 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties (out of 3) seen :55
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 3) seen :57
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 276 ms. (steps per millisecond=3623 ) properties (out of 3) seen :5920
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=3816 ) properties (out of 3) seen :18248
[2023-03-22 23:42:09] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:42:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:09] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:42:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:42:09] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 4 ms.
[2023-03-22 23:42:09] [INFO ] Added : 19 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 2 ms.
[2023-03-22 23:42:09] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:42:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:09] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:09] [INFO ] Added : 18 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[27, 5859, 18237]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:42:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:18] [INFO ] Invariant cache hit.
[2023-03-22 23:42:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 23:42:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:18] [INFO ] Invariant cache hit.
[2023-03-22 23:42:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-22 23:42:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 23:42:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:18] [INFO ] Invariant cache hit.
[2023-03-22 23:42:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2821 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 3) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 3) seen :73
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=3831 ) properties (out of 3) seen :8821
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=4587 ) properties (out of 3) seen :17089
[2023-03-22 23:42:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:19] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 23:42:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:20] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:42:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:20] [INFO ] Added : 19 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:20] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 14 ms.
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:20] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:20] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:20] [INFO ] Added : 18 causal constraints over 7 iterations in 31 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[28, 8774, 18237]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:42:31] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:31] [INFO ] Invariant cache hit.
[2023-03-22 23:42:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 23:42:31] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:31] [INFO ] Invariant cache hit.
[2023-03-22 23:42:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:31] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 23:42:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:42:31] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:31] [INFO ] Invariant cache hit.
[2023-03-22 23:42:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:31] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2791 resets, run finished after 576 ms. (steps per millisecond=1736 ) properties (out of 3) seen :53
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 3) seen :60
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 269 ms. (steps per millisecond=3717 ) properties (out of 3) seen :8648
Incomplete Best-First random walk after 1000000 steps, including 10 resets, run finished after 208 ms. (steps per millisecond=4807 ) properties (out of 3) seen :24929
[2023-03-22 23:42:33] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:42:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:33] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:42:33] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:33] [INFO ] Added : 19 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:33] [INFO ] Added : 8 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:42:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:33] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 5 ms.
[2023-03-22 23:42:33] [INFO ] Added : 18 causal constraints over 7 iterations in 36 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[29, 8774, 24916]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:42:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:46] [INFO ] Invariant cache hit.
[2023-03-22 23:42:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 23:42:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:46] [INFO ] Invariant cache hit.
[2023-03-22 23:42:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-22 23:42:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:42:46] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:42:46] [INFO ] Invariant cache hit.
[2023-03-22 23:42:46] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:46] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000008 steps, including 2772 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 3) seen :55
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=3164 ) properties (out of 3) seen :62
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 260 ms. (steps per millisecond=3846 ) properties (out of 3) seen :8777
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 216 ms. (steps per millisecond=4629 ) properties (out of 3) seen :27238
[2023-03-22 23:42:47] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:42:47] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:42:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:42:47] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 6 ms.
[2023-03-22 23:42:47] [INFO ] Added : 19 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 23:42:47] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 0 ms returned sat
[2023-03-22 23:42:48] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 4 ms.
[2023-03-22 23:42:48] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 23:42:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:42:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:42:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:42:48] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:42:48] [INFO ] Added : 18 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[29, 8774, 27231]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:43:01] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:01] [INFO ] Invariant cache hit.
[2023-03-22 23:43:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 23:43:01] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:01] [INFO ] Invariant cache hit.
[2023-03-22 23:43:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 23:43:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:43:01] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:01] [INFO ] Invariant cache hit.
[2023-03-22 23:43:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:01] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2756 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 3) seen :55
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=3154 ) properties (out of 3) seen :64
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 258 ms. (steps per millisecond=3875 ) properties (out of 3) seen :2892
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=4464 ) properties (out of 3) seen :16673
[2023-03-22 23:43:02] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 23:43:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:02] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 23:43:02] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 2 ms.
[2023-03-22 23:43:02] [INFO ] Added : 19 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:43:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 0 ms returned sat
[2023-03-22 23:43:02] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:02] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 23:43:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 23:43:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:03] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:03] [INFO ] Added : 18 causal constraints over 7 iterations in 30 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[29, 8774, 27231]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:43:16] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:16] [INFO ] Invariant cache hit.
[2023-03-22 23:43:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 23:43:16] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:16] [INFO ] Invariant cache hit.
[2023-03-22 23:43:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-22 23:43:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:43:16] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:16] [INFO ] Invariant cache hit.
[2023-03-22 23:43:16] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 30/30 places, 60/60 transitions.
Starting property specific reduction for FunctionPointer-PT-a016-UpperBounds-00
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:16] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 29 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :20
[2023-03-22 23:43:16] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:16] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 23:43:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:16] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:16] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:43:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:16] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 2 ms.
[2023-03-22 23:43:16] [INFO ] Added : 19 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[20]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:16] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2812 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 1) seen :29
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 1) seen :20
[2023-03-22 23:43:17] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:17] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 23:43:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:43:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:17] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:17] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 23:43:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:43:17] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:17] [INFO ] Added : 19 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[29]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:43:17] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:17] [INFO ] Invariant cache hit.
[2023-03-22 23:43:18] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 23:43:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:18] [INFO ] Invariant cache hit.
[2023-03-22 23:43:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-22 23:43:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:43:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:18] [INFO ] Invariant cache hit.
[2023-03-22 23:43:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2789 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 1) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :17
[2023-03-22 23:43:18] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 23:43:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 23:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:18] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 23:43:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-22 23:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 23:43:19] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:19] [INFO ] Added : 19 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[34]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:43:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:19] [INFO ] Invariant cache hit.
[2023-03-22 23:43:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 23:43:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:19] [INFO ] Invariant cache hit.
[2023-03-22 23:43:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 23:43:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 23:43:19] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:19] [INFO ] Invariant cache hit.
[2023-03-22 23:43:19] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 30/30 places, 60/60 transitions.
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:19] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2788 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 1) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 1) seen :19
[2023-03-22 23:43:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:20] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:43:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:20] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:20] [INFO ] Added : 19 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[34]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 23:43:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:20] [INFO ] Invariant cache hit.
[2023-03-22 23:43:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 23:43:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:20] [INFO ] Invariant cache hit.
[2023-03-22 23:43:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 23:43:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 23:43:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2023-03-22 23:43:20] [INFO ] Invariant cache hit.
[2023-03-22 23:43:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 30/30 places, 60/60 transitions.
Ending property specific reduction for FunctionPointer-PT-a016-UpperBounds-00 in 3519 ms.
Starting property specific reduction for FunctionPointer-PT-a016-UpperBounds-14
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:20] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10011 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :23
[2023-03-22 23:43:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:20] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 23:43:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 0 ms returned sat
[2023-03-22 23:43:20] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 2 ms.
[2023-03-22 23:43:20] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Graph (complete) has 106 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 27 transition count 54
Applied a total of 7 rules in 3 ms. Remains 27 /30 variables (removed 3) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/30 places, 54/60 transitions.
Normalized transition count is 39 out of 54 initially.
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:20] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=4149 ) properties (out of 1) seen :5290
[2023-03-22 23:43:21] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:21] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:43:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:21] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:21] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 3 ms.
[2023-03-22 23:43:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-22 23:43:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2023-03-22 23:43:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-22 23:43:21] [INFO ] Added : 9 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5290]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-22 23:43:25] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:25] [INFO ] Invariant cache hit.
[2023-03-22 23:43:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 23:43:25] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:25] [INFO ] Invariant cache hit.
[2023-03-22 23:43:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-22 23:43:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:43:25] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:25] [INFO ] Invariant cache hit.
[2023-03-22 23:43:25] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 27/27 places, 54/54 transitions.
Normalized transition count is 39 out of 54 initially.
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:25] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=4098 ) properties (out of 1) seen :5289
[2023-03-22 23:43:26] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:26] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 23:43:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:26] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 23:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 23:43:26] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:26] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 2 ms.
[2023-03-22 23:43:26] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2023-03-22 23:43:26] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-22 23:43:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-22 23:43:26] [INFO ] Added : 9 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5290]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-22 23:43:29] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:29] [INFO ] Invariant cache hit.
[2023-03-22 23:43:29] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 23:43:29] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:29] [INFO ] Invariant cache hit.
[2023-03-22 23:43:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-22 23:43:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:43:29] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:29] [INFO ] Invariant cache hit.
[2023-03-22 23:43:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 27/27 places, 54/54 transitions.
Ending property specific reduction for FunctionPointer-PT-a016-UpperBounds-14 in 9491 ms.
Starting property specific reduction for FunctionPointer-PT-a016-UpperBounds-15
Normalized transition count is 43 out of 60 initially.
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:29] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :176
[2023-03-22 23:43:29] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2023-03-22 23:43:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-22 23:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 23:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 23:43:29] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 23:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:29] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 3 ms.
[2023-03-22 23:43:29] [INFO ] Added : 18 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[176]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Graph (complete) has 106 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 27 transition count 54
Applied a total of 7 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/30 places, 54/60 transitions.
Normalized transition count is 39 out of 54 initially.
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:30] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :19
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=4184 ) properties (out of 1) seen :24231
[2023-03-22 23:43:30] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:43:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:30] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:30] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:31] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-22 23:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 23:43:31] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 2 ms.
[2023-03-22 23:43:31] [INFO ] Added : 20 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[24231]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 10 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-22 23:43:36] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:36] [INFO ] Invariant cache hit.
[2023-03-22 23:43:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 23:43:36] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:36] [INFO ] Invariant cache hit.
[2023-03-22 23:43:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-22 23:43:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 23:43:36] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:43:36] [INFO ] Invariant cache hit.
[2023-03-22 23:43:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 27/27 places, 54/54 transitions.
Normalized transition count is 39 out of 54 initially.
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:36] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=4761 ) properties (out of 1) seen :24252
[2023-03-22 23:43:37] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:43:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:43:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:43:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:43:37] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:43:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:43:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:43:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:43:37] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-22 23:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 23:43:37] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 2 ms.
[2023-03-22 23:43:37] [INFO ] Added : 20 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2385277]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-22 23:44:07] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:07] [INFO ] Invariant cache hit.
[2023-03-22 23:44:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-22 23:44:07] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:07] [INFO ] Invariant cache hit.
[2023-03-22 23:44:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:44:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-22 23:44:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 23:44:07] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:07] [INFO ] Invariant cache hit.
[2023-03-22 23:44:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 27/27 places, 54/54 transitions.
Normalized transition count is 39 out of 54 initially.
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:44:07] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=4385 ) properties (out of 1) seen :24240
[2023-03-22 23:44:08] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2023-03-22 23:44:08] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 23:44:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 23:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:44:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:44:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:44:08] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:44:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:44:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 23:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:44:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 23:44:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:44:08] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-22 23:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 23:44:08] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 3 ms.
[2023-03-22 23:44:08] [INFO ] Added : 20 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10742292]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-22 23:44:09] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:09] [INFO ] Invariant cache hit.
[2023-03-22 23:44:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-22 23:44:09] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:09] [INFO ] Invariant cache hit.
[2023-03-22 23:44:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 23:44:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-22 23:44:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 23:44:09] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2023-03-22 23:44:09] [INFO ] Invariant cache hit.
[2023-03-22 23:44:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 27/27 places, 54/54 transitions.
Ending property specific reduction for FunctionPointer-PT-a016-UpperBounds-15 in 39906 ms.
[2023-03-22 23:44:09] [INFO ] Flatten gal took : 25 ms
[2023-03-22 23:44:09] [INFO ] Applying decomposition
[2023-03-22 23:44:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph942280144370356014.txt' '-o' '/tmp/graph942280144370356014.bin' '-w' '/tmp/graph942280144370356014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph942280144370356014.bin' '-l' '-1' '-v' '-w' '/tmp/graph942280144370356014.weights' '-q' '0' '-e' '0.001'
[2023-03-22 23:44:09] [INFO ] Decomposing Gal with order
[2023-03-22 23:44:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 23:44:10] [INFO ] Removed a total of 92 redundant transitions.
[2023-03-22 23:44:10] [INFO ] Flatten gal took : 29 ms
[2023-03-22 23:44:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2023-03-22 23:44:10] [INFO ] Time to serialize gal into /tmp/UpperBounds9012593488806706772.gal : 2 ms
[2023-03-22 23:44:10] [INFO ] Time to serialize properties into /tmp/UpperBounds3908305541831085553.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9012593488806706772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3908305541831085553.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds3908305541831085553.prop.
Detected timeout of ITS tools.
[2023-03-23 00:04:51] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:04:51] [INFO ] Time to serialize gal into /tmp/UpperBounds2023052403832644126.gal : 1 ms
[2023-03-23 00:04:51] [INFO ] Time to serialize properties into /tmp/UpperBounds12143752382604327759.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2023052403832644126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12143752382604327759.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds12143752382604327759.prop.
Detected timeout of ITS tools.
[2023-03-23 00:25:33] [INFO ] Flatten gal took : 161 ms
[2023-03-23 00:25:33] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-23 00:25:33] [INFO ] Transformed 30 places.
[2023-03-23 00:25:33] [INFO ] Transformed 60 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 00:25:33] [INFO ] Time to serialize gal into /tmp/UpperBounds5504866320370595060.gal : 3 ms
[2023-03-23 00:25:33] [INFO ] Time to serialize properties into /tmp/UpperBounds17962751059450376990.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5504866320370595060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17962751059450376990.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17962751059450376990.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5480536 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15751628 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-a016, 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 r165-tall-167838850700629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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