About the Execution of ITS-Tools for FunctionPointer-PT-a064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 1 1 1 1 inf inf 1 inf ? inf 1 inf inf inf 1 inf | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007300045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FunctionPointer-PT-a064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007300045
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 34K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748721757109
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-a064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-31 20:02:39] [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]
[2025-05-31 20:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 20:02:39] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-05-31 20:02:39] [INFO ] Transformed 40 places.
[2025-05-31 20:02:39] [INFO ] Transformed 70 transitions.
[2025-05-31 20:02:39] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 4 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 20:02:39] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2025-05-31 20:02:39] [INFO ] Computed 4 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 10000 steps (24 resets) in 46 ms. (212 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (181 resets) in 249 ms. (360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 14, 10, 40, 11, 6, 23, 18, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 20:02:40] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 20:02:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:40] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-05-31 20:02:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 20:02:40] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-31 20:02:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:02:40] [INFO ] [Real]Added 8 Read/Feed constraints in 24 ms returned sat
[2025-05-31 20:02:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-05-31 20:02:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 20:02:41] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-31 20:02:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:42] [INFO ] Deduced a trap composed of 7 places in 1049 ms of which 36 ms to minimize.
[2025-05-31 20:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1089 ms
[2025-05-31 20:02:42] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 25 ms.
[2025-05-31 20:02:42] [INFO ] Added : 19 causal constraints over 5 iterations in 110 ms. Result :sat
Minimization took 48 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-05-31 20:02:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:42] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2025-05-31 20:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2025-05-31 20:02:42] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 10 ms.
[2025-05-31 20:02:42] [INFO ] Added : 19 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 20:02:42] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-05-31 20:02:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:43] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-31 20:02:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:43] [INFO ] Deduced a trap composed of 7 places in 767 ms of which 3 ms to minimize.
[2025-05-31 20:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 776 ms
[2025-05-31 20:02:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 10 ms.
[2025-05-31 20:02:43] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:02:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:44] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:44] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2025-05-31 20:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2025-05-31 20:02:44] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 9 ms.
[2025-05-31 20:02:44] [INFO ] Added : 6 causal constraints over 2 iterations in 44 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:02:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:44] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
[2025-05-31 20:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 20:02:44] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2025-05-31 20:02:44] [INFO ] Added : 18 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:02:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:44] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 9 ms to minimize.
[2025-05-31 20:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-05-31 20:02:44] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2025-05-31 20:02:44] [INFO ] Added : 14 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-31 20:02:44] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:45] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
[2025-05-31 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2025-05-31 20:02:45] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:45] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 3 ms to minimize.
[2025-05-31 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-05-31 20:02:45] [INFO ] Added : 12 causal constraints over 3 iterations in 111 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:45] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 7 ms to minimize.
[2025-05-31 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-05-31 20:02:45] [INFO ] Added : 18 causal constraints over 6 iterations in 130 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 20:02:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:45] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 3 ms to minimize.
[2025-05-31 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-05-31 20:02:45] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2025-05-31 20:02:45] [INFO ] Added : 13 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 14, 10, 40, 11, 6, 23, 18, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64, 55, 13, 64, 11, 23, 82, 1714, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 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 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 63
Applied a total of 4 rules in 57 ms. Remains 32 /34 variables (removed 2) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 32/34 places, 63/66 transitions.
[2025-05-31 20:02:46] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :[8, 6, 26, 13, 21, 5, 153, 6, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[64, 55, 26, 64, 21, 23, 153, 1714, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 20:02:47] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 32 cols
[2025-05-31 20:02:47] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[64, 55, 26, 64, 21, 23, 153, 1714, 6] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000027 steps (2 resets) in 904 ms. (1105 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 4421 ms. (2035 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5731, 5750, 3275, 76, 1994, 964, 6440, 6982, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 20:02:52] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 20:02:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:02:52] [INFO ] [Real]Added 8 Read/Feed constraints in 26 ms returned sat
[2025-05-31 20:02:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:02:52] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:52] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
[2025-05-31 20:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-05-31 20:02:52] [INFO ] Added : 4 causal constraints over 2 iterations in 136 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:52] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2025-05-31 20:02:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-31 20:02:52] [INFO ] Added : 4 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:02:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:53] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:53] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 4 ms to minimize.
[2025-05-31 20:02:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2025-05-31 20:02:53] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 13 ms.
[2025-05-31 20:02:53] [INFO ] Added : 16 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:02:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:53] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:53] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:53] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 3 ms to minimize.
[2025-05-31 20:02:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2025-05-31 20:02:53] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 9 ms.
[2025-05-31 20:02:53] [INFO ] Added : 15 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 20:02:53] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:02:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:54] [INFO ] Deduced a trap composed of 6 places in 701 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:54] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 3 ms to minimize.
[2025-05-31 20:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 813 ms
[2025-05-31 20:02:54] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 9 ms.
[2025-05-31 20:02:54] [INFO ] Added : 18 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:55] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
[2025-05-31 20:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 20:02:55] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 20 ms.
[2025-05-31 20:02:55] [INFO ] Added : 15 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:55] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
[2025-05-31 20:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 20:02:55] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 18 ms.
[2025-05-31 20:02:55] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:02:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 6 ms to minimize.
[2025-05-31 20:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-05-31 20:02:55] [INFO ] Added : 4 causal constraints over 2 iterations in 152 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 20:02:55] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:02:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:02:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:02:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:02:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:56] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:02:56] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 4 ms to minimize.
[2025-05-31 20:02:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2025-05-31 20:02:56] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 7 ms.
[2025-05-31 20:02:56] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5731, 5750, 3275, 76, 1994, 964, 6440, 6982, 1000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5731, 5750, 3275, 76, 1994, 83404, 227773, 6982, 1240] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 32/32 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Applied a total of 0 rules in 12 ms. Remains 32 /32 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-31 20:03:38] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:03:38] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-31 20:03:38] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:03:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:03:38] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 20:03:38] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-05-31 20:03:38] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:03:38] [INFO ] Invariant cache hit.
[2025-05-31 20:03:38] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 43 constraints, problems are : Problem set: 0 solved, 61 unsolved in 19593 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 44/75 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:03:59] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 36 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 57/105 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 105 constraints, problems are : Problem set: 0 solved, 61 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27786ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 27840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28333 ms. Remains : 32/32 places, 63/63 transitions.
[2025-05-31 20:04:06] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 9) seen :[2147483647, 2147483647, 2147483647, 6, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, 76, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 20:04:06] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:04:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, 76, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000043 steps (2 resets) in 676 ms. (1477 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 565 ms. (1766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[+inf]
[2025-05-31 20:04:08] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2025-05-31 20:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:08] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 20:04:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:08] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:04:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:04:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:08] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:08] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:08] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 3 ms to minimize.
[2025-05-31 20:04:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2025-05-31 20:04:08] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 18 ms.
[2025-05-31 20:04:08] [INFO ] Added : 15 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[+inf]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Graph (complete) has 113 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 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 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 59
Applied a total of 5 rules in 28 ms. Remains 30 /32 variables (removed 2) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 30/32 places, 59/63 transitions.
[2025-05-31 20:04:08] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[76] Max Struct:[+inf]
[2025-05-31 20:04:08] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2025-05-31 20:04:08] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 972 ms. (1027 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[+inf]
[2025-05-31 20:04:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 20:04:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:10] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:04:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 20:04:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:10] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
[2025-05-31 20:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-05-31 20:04:10] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2025-05-31 20:04:10] [INFO ] Added : 15 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-05-31 20:04:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-31 20:04:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:10] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 20:04:10] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-05-31 20:04:10] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:10] [INFO ] Invariant cache hit.
[2025-05-31 20:04:10] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5515ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5747 ms. Remains : 30/30 places, 59/59 transitions.
[2025-05-31 20:04:16] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[78] Max Struct:[+inf]
[2025-05-31 20:04:16] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[78] Max Struct:[+inf]
RANDOM walk for 1000039 steps (2 resets) in 579 ms. (1724 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 477 ms. (2092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[+inf]
[2025-05-31 20:04:17] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 20:04:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:17] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 20:04:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 20:04:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:17] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 5 ms to minimize.
[2025-05-31 20:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 20:04:17] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 5 ms.
[2025-05-31 20:04:17] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-05-31 20:04:17] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 20:04:17] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 20:04:18] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-05-31 20:04:18] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:18] [INFO ] Invariant cache hit.
[2025-05-31 20:04:18] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5417ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5583 ms. Remains : 30/30 places, 59/59 transitions.
[2025-05-31 20:04:23] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[10]
Current structural bounds on expressions (after cover walk) : Max Seen:[78] Max Struct:[+inf]
RANDOM walk for 40031 steps (8 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
[2025-05-31 20:04:24] [INFO ] Flatten gal took : 51 ms
[2025-05-31 20:04:24] [INFO ] Flatten gal took : 19 ms
[2025-05-31 20:04:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15090278190579564436.gal : 10 ms
[2025-05-31 20:04:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12978131217293772283.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15090278190579564436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12978131217293772283.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12978131217293772283.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 132
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5312 after 485149
Interrupted probabilistic random walk after 2225778 steps, run timeout after 3001 ms. (steps per millisecond=741 ) properties seen :0 out of 1
Probabilistic random walk after 2225778 steps, saw 1498560 distinct states, run finished after 3015 ms. (steps per millisecond=738 ) properties seen :0
[2025-05-31 20:04:26] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:26] [INFO ] Invariant cache hit.
[2025-05-31 20:04:26] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 459 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=229 )
Parikh walk visited 1 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[78] Max Struct:[+inf]
Starting property specific reduction for FunctionPointer-PT-a064-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 20:04:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[73] Max Struct:[+inf]
[2025-05-31 20:04:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:04:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-31 20:04:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:27] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 20:04:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 20:04:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-05-31 20:04:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-31 20:04:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:27] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 4 ms to minimize.
[2025-05-31 20:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-05-31 20:04:27] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2025-05-31 20:04:27] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[73] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[73] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 59/59 transitions.
[2025-05-31 20:04:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[20]
Current structural bounds on expressions (after cover walk) : Max Seen:[73] Max Struct:[+inf]
[2025-05-31 20:04:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[73] Max Struct:[+inf]
RANDOM walk for 1000061 steps (2 resets) in 1213 ms. (823 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 460 ms. (2169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[73] Max Struct:[+inf]
[2025-05-31 20:04:29] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-05-31 20:04:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 20:04:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:29] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 20:04:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 20:04:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 20:04:29] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 20:04:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 20:04:29] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 4 ms to minimize.
[2025-05-31 20:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-05-31 20:04:29] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2025-05-31 20:04:29] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[73] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[73] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2025-05-31 20:04:29] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:29] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-31 20:04:29] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 20:04:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 20:04:30] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 20:04:30] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-05-31 20:04:30] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:30] [INFO ] Invariant cache hit.
[2025-05-31 20:04:30] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2006ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2242 ms. Remains : 30/30 places, 59/59 transitions.
[2025-05-31 20:04:32] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[14]
Current structural bounds on expressions (after cover walk) : Max Seen:[73] Max Struct:[+inf]
[2025-05-31 20:04:32] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 40085 steps (8 resets) in 76 ms. (520 steps per ms) remains 1/1 properties
[2025-05-31 20:04:32] [INFO ] Flatten gal took : 17 ms
[2025-05-31 20:04:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality357236830828276301.gal : 4 ms
[2025-05-31 20:04:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1390687438201717588.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality357236830828276301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1390687438201717588.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality1390687438201717588.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 132
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :132 after 5312
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5312 after 485149
Interrupted probabilistic random walk after 2199634 steps, run timeout after 3001 ms. (steps per millisecond=732 ) properties seen :0 out of 1
Probabilistic random walk after 2199634 steps, saw 1480610 distinct states, run finished after 3001 ms. (steps per millisecond=732 ) properties seen :0
[2025-05-31 20:04:35] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2025-05-31 20:04:35] [INFO ] Invariant cache hit.
[2025-05-31 20:04:35] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 434 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=217 )
Parikh walk visited 1 properties in 1 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[73] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a064-UpperBounds-08 in 8153 ms.
[2025-05-31 20:04:35] [INFO ] Flatten gal took : 9 ms
[2025-05-31 20:04:35] [INFO ] Applying decomposition
[2025-05-31 20:04:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12722953274162856761.txt' '-o' '/tmp/graph12722953274162856761.bin' '-w' '/tmp/graph12722953274162856761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12722953274162856761.bin' '-l' '-1' '-v' '-w' '/tmp/graph12722953274162856761.weights' '-q' '0' '-e' '0.001'
[2025-05-31 20:04:35] [INFO ] Decomposing Gal with order
[2025-05-31 20:04:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 20:04:35] [INFO ] Removed a total of 91 redundant transitions.
[2025-05-31 20:04:35] [INFO ] Flatten gal took : 67 ms
[2025-05-31 20:04:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 11 ms.
[2025-05-31 20:04:35] [INFO ] Time to serialize gal into /tmp/UpperBounds14697139241907827879.gal : 5 ms
[2025-05-31 20:04:35] [INFO ] Time to serialize properties into /tmp/UpperBounds7142578522023924929.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14697139241907827879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7142578522023924929.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds7142578522023924929.prop.
Detected timeout of ITS tools.
[2025-05-31 20:25:13] [INFO ] Flatten gal took : 22 ms
[2025-05-31 20:25:13] [INFO ] Time to serialize gal into /tmp/UpperBounds16677961427774452545.gal : 4 ms
[2025-05-31 20:25:13] [INFO ] Time to serialize properties into /tmp/UpperBounds9240790799442908843.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16677961427774452545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9240790799442908843.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds9240790799442908843.prop.
Detected timeout of ITS tools.
[2025-05-31 20:45:52] [INFO ] Flatten gal took : 10 ms
[2025-05-31 20:45:52] [INFO ] Input system was already deterministic with 59 transitions.
[2025-05-31 20:45:52] [INFO ] Transformed 30 places.
[2025-05-31 20:45:52] [INFO ] Transformed 59 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
[2025-05-31 20:45:52] [INFO ] Time to serialize gal into /tmp/UpperBounds6280457536040425412.gal : 2 ms
[2025-05-31 20:45:52] [INFO ] Time to serialize properties into /tmp/UpperBounds12914063471996516616.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6280457536040425412.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12914063471996516616.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12914063471996516616.prop.
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-a064"
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-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-a064, 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 r100-smll-174867007300045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 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.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 '
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 ;