About the Execution of ITS-Tools for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16224.327 | 3600000.00 | 3638536.00 | 41543.40 | 0 0 ? 16 0 0 0 0 16 ? 0 1 ? 0 0 16 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850800741.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FunctionPointer-PT-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850800741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679575701036
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 12:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 12:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:48:22] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2023-03-23 12:48:22] [INFO ] Transformed 2826 places.
[2023-03-23 12:48:23] [INFO ] Transformed 8960 transitions.
[2023-03-23 12:48:23] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-23 12:48:23] [INFO ] Computed 4 place invariants in 109 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :17
FORMULA FunctionPointer-PT-c016-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
[2023-03-23 12:48:23] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-23 12:48:23] [INFO ] Computed 4 place invariants in 47 ms
[2023-03-23 12:48:24] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-23 12:48:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:25] [INFO ] [Real]Absence check using state equation in 1004 ms returned sat
[2023-03-23 12:48:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2023-03-23 12:48:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 33 ms returned sat
[2023-03-23 12:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:26] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2023-03-23 12:48:26] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-23 12:48:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 128 ms returned sat
[2023-03-23 12:48:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 688 ms.
[2023-03-23 12:48:29] [INFO ] Deduced a trap composed of 133 places in 1182 ms of which 23 ms to minimize.
[2023-03-23 12:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1440 ms
[2023-03-23 12:48:29] [INFO ] Added : 2 causal constraints over 1 iterations in 2608 ms. Result :sat
[2023-03-23 12:48:29] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-23 12:48:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:30] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2023-03-23 12:48:30] [INFO ] [Real]Added 479 Read/Feed constraints in 83 ms returned sat
[2023-03-23 12:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-23 12:48:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:31] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2023-03-23 12:48:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 78 ms returned sat
[2023-03-23 12:48:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 482 ms.
[2023-03-23 12:48:32] [INFO ] Added : 0 causal constraints over 0 iterations in 689 ms. Result :sat
[2023-03-23 12:48:32] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-23 12:48:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:33] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-23 12:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-23 12:48:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:34] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2023-03-23 12:48:35] [INFO ] [Nat]Added 479 Read/Feed constraints in 321 ms returned sat
[2023-03-23 12:48:35] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 485 ms.
[2023-03-23 12:48:35] [INFO ] Added : 2 causal constraints over 1 iterations in 845 ms. Result :sat
[2023-03-23 12:48:36] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-23 12:48:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:37] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-23 12:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-23 12:48:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 12:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:38] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2023-03-23 12:48:38] [INFO ] [Nat]Added 479 Read/Feed constraints in 93 ms returned sat
[2023-03-23 12:48:38] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 469 ms.
[2023-03-23 12:48:39] [INFO ] Added : 1 causal constraints over 1 iterations in 805 ms. Result :sat
[2023-03-23 12:48:39] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-23 12:48:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:40] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-23 12:48:40] [INFO ] [Real]Added 479 Read/Feed constraints in 81 ms returned sat
[2023-03-23 12:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-23 12:48:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 12:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:41] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2023-03-23 12:48:41] [INFO ] [Nat]Added 479 Read/Feed constraints in 80 ms returned sat
[2023-03-23 12:48:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 428 ms.
[2023-03-23 12:48:42] [INFO ] Added : 0 causal constraints over 0 iterations in 634 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 16, -1, -1, 16] Max seen :[0, 2, 0, 0, 1]
Support contains 5 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.14 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 301 places :
Symmetric choice reduction at 1 with 301 rule applications. Total rules 686 place count 1118 transition count 3282
Iterating global reduction 1 with 301 rules applied. Total rules applied 987 place count 1118 transition count 3282
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 1339 place count 1118 transition count 2930
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1494 place count 963 transition count 2620
Iterating global reduction 2 with 155 rules applied. Total rules applied 1649 place count 963 transition count 2620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1709 place count 963 transition count 2560
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1723 place count 949 transition count 2532
Iterating global reduction 3 with 14 rules applied. Total rules applied 1737 place count 949 transition count 2532
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1751 place count 935 transition count 2504
Iterating global reduction 3 with 14 rules applied. Total rules applied 1765 place count 935 transition count 2504
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1779 place count 921 transition count 2476
Iterating global reduction 3 with 14 rules applied. Total rules applied 1793 place count 921 transition count 2476
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1807 place count 907 transition count 2448
Iterating global reduction 3 with 14 rules applied. Total rules applied 1821 place count 907 transition count 2448
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1835 place count 893 transition count 2420
Iterating global reduction 3 with 14 rules applied. Total rules applied 1849 place count 893 transition count 2420
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1862 place count 880 transition count 2394
Iterating global reduction 3 with 13 rules applied. Total rules applied 1875 place count 880 transition count 2394
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1888 place count 867 transition count 2368
Iterating global reduction 3 with 13 rules applied. Total rules applied 1901 place count 867 transition count 2368
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1955 place count 813 transition count 2166
Iterating global reduction 3 with 54 rules applied. Total rules applied 2009 place count 813 transition count 2166
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2070 place count 752 transition count 1922
Iterating global reduction 3 with 61 rules applied. Total rules applied 2131 place count 752 transition count 1922
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2192 place count 691 transition count 1772
Iterating global reduction 3 with 61 rules applied. Total rules applied 2253 place count 691 transition count 1772
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2314 place count 630 transition count 1650
Iterating global reduction 3 with 61 rules applied. Total rules applied 2375 place count 630 transition count 1650
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2436 place count 569 transition count 1528
Iterating global reduction 3 with 61 rules applied. Total rules applied 2497 place count 569 transition count 1528
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2558 place count 508 transition count 1406
Iterating global reduction 3 with 61 rules applied. Total rules applied 2619 place count 508 transition count 1406
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2679 place count 448 transition count 1286
Iterating global reduction 3 with 60 rules applied. Total rules applied 2739 place count 448 transition count 1286
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2753 place count 434 transition count 1258
Iterating global reduction 3 with 14 rules applied. Total rules applied 2767 place count 434 transition count 1258
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 2773 place count 434 transition count 1252
Applied a total of 2773 rules in 1223 ms. Remains 434 /1628 variables (removed 1194) and now considering 1252/5962 (removed 4710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1224 ms. Remains : 434/1628 places, 1252/5962 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:48:43] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2412 ms. (steps per millisecond=414 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 5) seen :342
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 5) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 5) seen :147
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 5) seen :1736
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 5) seen :11
[2023-03-23 12:48:49] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:48:49] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-23 12:48:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:50] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:48:50] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:48:50] [INFO ] [Real]Added 80 Read/Feed constraints in 69 ms returned sat
[2023-03-23 12:48:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:50] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-23 12:48:50] [INFO ] [Nat]Added 80 Read/Feed constraints in 65 ms returned sat
[2023-03-23 12:48:50] [INFO ] Deduced a trap composed of 125 places in 188 ms of which 1 ms to minimize.
[2023-03-23 12:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-23 12:48:50] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 81 ms.
[2023-03-23 12:48:51] [INFO ] Added : 17 causal constraints over 4 iterations in 320 ms. Result :sat
Minimization took 48 ms.
[2023-03-23 12:48:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:51] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:48:51] [INFO ] [Real]Added 80 Read/Feed constraints in 39 ms returned sat
[2023-03-23 12:48:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:51] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-23 12:48:51] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:48:51] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-23 12:48:51] [INFO ] Added : 0 causal constraints over 0 iterations in 129 ms. Result :sat
Minimization took 49 ms.
[2023-03-23 12:48:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:52] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:48:52] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-23 12:48:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:52] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-23 12:48:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 32 ms returned sat
[2023-03-23 12:48:52] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 1 ms to minimize.
[2023-03-23 12:48:52] [INFO ] Deduced a trap composed of 99 places in 191 ms of which 1 ms to minimize.
[2023-03-23 12:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2023-03-23 12:48:52] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-23 12:48:53] [INFO ] Added : 32 causal constraints over 7 iterations in 422 ms. Result :sat
Minimization took 58 ms.
[2023-03-23 12:48:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:53] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-23 12:48:53] [INFO ] [Real]Added 80 Read/Feed constraints in 64 ms returned sat
[2023-03-23 12:48:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:53] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-23 12:48:54] [INFO ] [Nat]Added 80 Read/Feed constraints in 56 ms returned sat
[2023-03-23 12:48:54] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 0 ms to minimize.
[2023-03-23 12:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-23 12:48:54] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 64 ms.
[2023-03-23 12:48:54] [INFO ] Added : 12 causal constraints over 5 iterations in 282 ms. Result :sat
Minimization took 45 ms.
[2023-03-23 12:48:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:48:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:54] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:48:54] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-23 12:48:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:48:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:48:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:48:55] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-23 12:48:55] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:48:55] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 71 ms.
[2023-03-23 12:48:55] [INFO ] Added : 0 causal constraints over 0 iterations in 126 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1, 16, -1, -1, 16] Max seen :[312, 3, 131, 1732, 2]
FORMULA FunctionPointer-PT-c016-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 46 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 434/434 places, 1252/1252 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:00] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2302 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties (out of 3) seen :131
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 3) seen :10
[2023-03-23 12:49:05] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:05] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-23 12:49:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:05] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-23 12:49:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:49:05] [INFO ] [Real]Added 80 Read/Feed constraints in 71 ms returned sat
[2023-03-23 12:49:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:05] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-23 12:49:05] [INFO ] [Nat]Added 80 Read/Feed constraints in 59 ms returned sat
[2023-03-23 12:49:06] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 1 ms to minimize.
[2023-03-23 12:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-23 12:49:06] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-23 12:49:06] [INFO ] Added : 17 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 46 ms.
[2023-03-23 12:49:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:06] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:49:06] [INFO ] [Real]Added 80 Read/Feed constraints in 20 ms returned sat
[2023-03-23 12:49:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:07] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-23 12:49:07] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-23 12:49:07] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 1 ms to minimize.
[2023-03-23 12:49:07] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 1 ms to minimize.
[2023-03-23 12:49:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2023-03-23 12:49:07] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 74 ms.
[2023-03-23 12:49:07] [INFO ] Added : 32 causal constraints over 7 iterations in 408 ms. Result :sat
Minimization took 57 ms.
[2023-03-23 12:49:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:08] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-23 12:49:08] [INFO ] [Real]Added 80 Read/Feed constraints in 67 ms returned sat
[2023-03-23 12:49:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:08] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:49:08] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-23 12:49:08] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 0 ms to minimize.
[2023-03-23 12:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-23 12:49:08] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-23 12:49:09] [INFO ] Added : 12 causal constraints over 5 iterations in 293 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[312, 131, 1732]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 45 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 45 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 12:49:14] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-23 12:49:14] [INFO ] Invariant cache hit.
[2023-03-23 12:49:14] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-23 12:49:14] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-23 12:49:14] [INFO ] Invariant cache hit.
[2023-03-23 12:49:14] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:49:15] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-23 12:49:15] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-23 12:49:15] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-23 12:49:15] [INFO ] Invariant cache hit.
[2023-03-23 12:49:16] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1711 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-02
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:16] [INFO ] Computed 3 place invariants in 11 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-23 12:49:16] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:16] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-23 12:49:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:16] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-23 12:49:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:16] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-23 12:49:16] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:49:16] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:49:16] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 67 ms.
[2023-03-23 12:49:16] [INFO ] Added : 15 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 432 transition count 1246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 430 transition count 1242
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 430 transition count 1242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 429 transition count 1236
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 428 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 427 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 421 transition count 1218
Applied a total of 32 rules in 136 ms. Remains 421 /434 variables (removed 13) and now considering 1218/1252 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 421/434 places, 1218/1252 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2023-03-23 12:49:17] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2193 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 1) seen :0
[2023-03-23 12:49:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-23 12:49:20] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-23 12:49:20] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-23 12:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:20] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-23 12:49:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:20] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-23 12:49:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 20 ms returned sat
[2023-03-23 12:49:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 70 ms.
[2023-03-23 12:49:20] [INFO ] Added : 16 causal constraints over 5 iterations in 327 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 47 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-23 12:49:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:49:20] [INFO ] Invariant cache hit.
[2023-03-23 12:49:21] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-23 12:49:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:49:21] [INFO ] Invariant cache hit.
[2023-03-23 12:49:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:22] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2023-03-23 12:49:22] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 12:49:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-23 12:49:22] [INFO ] Invariant cache hit.
[2023-03-23 12:49:22] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1728 ms. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 6607 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-09
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:22] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-23 12:49:22] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:22] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 12:49:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:22] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-23 12:49:22] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:49:22] [INFO ] [Real]Added 80 Read/Feed constraints in 23 ms returned sat
[2023-03-23 12:49:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:23] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-23 12:49:23] [INFO ] [Nat]Added 80 Read/Feed constraints in 31 ms returned sat
[2023-03-23 12:49:23] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 0 ms to minimize.
[2023-03-23 12:49:23] [INFO ] Deduced a trap composed of 109 places in 191 ms of which 1 ms to minimize.
[2023-03-23 12:49:23] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 0 ms to minimize.
[2023-03-23 12:49:24] [INFO ] Deduced a trap composed of 96 places in 193 ms of which 0 ms to minimize.
[2023-03-23 12:49:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 880 ms
[2023-03-23 12:49:24] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 68 ms.
[2023-03-23 12:49:24] [INFO ] Added : 22 causal constraints over 5 iterations in 319 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 431 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 431 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 430 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 430 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 429 transition count 1240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 429 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 428 transition count 1238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 428 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 427 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 427 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 426 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 426 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 425 transition count 1232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 425 transition count 1232
Applied a total of 18 rules in 118 ms. Remains 425 /434 variables (removed 9) and now considering 1232/1252 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 425/434 places, 1232/1252 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:24] [INFO ] Computed 3 place invariants in 9 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 2236 ms. (steps per millisecond=447 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 1) seen :129
[2023-03-23 12:49:27] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:27] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 12:49:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:27] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-23 12:49:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:27] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2023-03-23 12:49:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:28] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-23 12:49:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2023-03-23 12:49:28] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 0 ms to minimize.
[2023-03-23 12:49:28] [INFO ] Deduced a trap composed of 99 places in 186 ms of which 1 ms to minimize.
[2023-03-23 12:49:28] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 0 ms to minimize.
[2023-03-23 12:49:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 643 ms
[2023-03-23 12:49:28] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 69 ms.
[2023-03-23 12:49:29] [INFO ] Added : 41 causal constraints over 10 iterations in 538 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[129]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 45 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-23 12:49:30] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:30] [INFO ] Invariant cache hit.
[2023-03-23 12:49:30] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-23 12:49:30] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:30] [INFO ] Invariant cache hit.
[2023-03-23 12:49:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:31] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2023-03-23 12:49:31] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 12:49:31] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:31] [INFO ] Invariant cache hit.
[2023-03-23 12:49:31] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1573 ms. Remains : 425/425 places, 1232/1232 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:31] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2274 ms. (steps per millisecond=439 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 1) seen :146
[2023-03-23 12:49:34] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:34] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-23 12:49:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:35] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-23 12:49:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:35] [INFO ] [Real]Added 75 Read/Feed constraints in 20 ms returned sat
[2023-03-23 12:49:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:35] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-23 12:49:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 17 ms returned sat
[2023-03-23 12:49:35] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 1 ms to minimize.
[2023-03-23 12:49:35] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 1 ms to minimize.
[2023-03-23 12:49:35] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 0 ms to minimize.
[2023-03-23 12:49:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 640 ms
[2023-03-23 12:49:36] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 67 ms.
[2023-03-23 12:49:36] [INFO ] Added : 41 causal constraints over 10 iterations in 502 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[146]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 46 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-23 12:49:37] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:37] [INFO ] Invariant cache hit.
[2023-03-23 12:49:37] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-23 12:49:37] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:37] [INFO ] Invariant cache hit.
[2023-03-23 12:49:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:38] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2023-03-23 12:49:38] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-23 12:49:38] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:38] [INFO ] Invariant cache hit.
[2023-03-23 12:49:39] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1743 ms. Remains : 425/425 places, 1232/1232 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:39] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 1) seen :136
[2023-03-23 12:49:42] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-23 12:49:42] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 12:49:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:42] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-23 12:49:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:42] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2023-03-23 12:49:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:42] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-23 12:49:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 18 ms returned sat
[2023-03-23 12:49:42] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 0 ms to minimize.
[2023-03-23 12:49:43] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 0 ms to minimize.
[2023-03-23 12:49:43] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 5 ms to minimize.
[2023-03-23 12:49:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 655 ms
[2023-03-23 12:49:43] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 74 ms.
[2023-03-23 12:49:43] [INFO ] Added : 41 causal constraints over 10 iterations in 515 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[146]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 51 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-23 12:49:44] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:44] [INFO ] Invariant cache hit.
[2023-03-23 12:49:45] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-23 12:49:45] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:45] [INFO ] Invariant cache hit.
[2023-03-23 12:49:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:49:46] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-23 12:49:46] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-23 12:49:46] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-23 12:49:46] [INFO ] Invariant cache hit.
[2023-03-23 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 425/425 places, 1232/1232 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 23798 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-12
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:46] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :5
[2023-03-23 12:49:46] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-23 12:49:46] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-23 12:49:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:46] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-23 12:49:46] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-23 12:49:46] [INFO ] [Real]Added 80 Read/Feed constraints in 43 ms returned sat
[2023-03-23 12:49:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:47] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-23 12:49:47] [INFO ] [Nat]Added 80 Read/Feed constraints in 61 ms returned sat
[2023-03-23 12:49:47] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 0 ms to minimize.
[2023-03-23 12:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-23 12:49:47] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-23 12:49:47] [INFO ] Added : 13 causal constraints over 6 iterations in 340 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 432 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 429 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 427 transition count 1230
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 427 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 425 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 423 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 423 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 421 transition count 1216
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 421 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 419 transition count 1212
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 415 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 414 transition count 1202
Applied a total of 46 rules in 130 ms. Remains 414 /434 variables (removed 20) and now considering 1202/1252 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 414/434 places, 1202/1252 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:49:47] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2196 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :1698
[2023-03-23 12:49:50] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:49:50] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-23 12:49:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:51] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-23 12:49:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:49:51] [INFO ] [Real]Added 74 Read/Feed constraints in 42 ms returned sat
[2023-03-23 12:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:51] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-23 12:49:51] [INFO ] [Nat]Added 74 Read/Feed constraints in 62 ms returned sat
[2023-03-23 12:49:51] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 1 ms to minimize.
[2023-03-23 12:49:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-23 12:49:51] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 68 ms.
[2023-03-23 12:49:51] [INFO ] Added : 5 causal constraints over 3 iterations in 228 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1698]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-23 12:49:54] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:49:54] [INFO ] Invariant cache hit.
[2023-03-23 12:49:54] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-23 12:49:54] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:49:54] [INFO ] Invariant cache hit.
[2023-03-23 12:49:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:49:55] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2023-03-23 12:49:55] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 12:49:55] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:49:55] [INFO ] Invariant cache hit.
[2023-03-23 12:49:55] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1715 ms. Remains : 414/414 places, 1202/1202 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:49:55] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2160 ms. (steps per millisecond=462 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :1751
[2023-03-23 12:49:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:49:58] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-23 12:49:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:59] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-23 12:49:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:49:59] [INFO ] [Real]Added 74 Read/Feed constraints in 40 ms returned sat
[2023-03-23 12:49:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:49:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:49:59] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-23 12:49:59] [INFO ] [Nat]Added 74 Read/Feed constraints in 61 ms returned sat
[2023-03-23 12:49:59] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 1 ms to minimize.
[2023-03-23 12:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-23 12:49:59] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 63 ms.
[2023-03-23 12:49:59] [INFO ] Added : 5 causal constraints over 3 iterations in 215 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1751]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 39 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-23 12:50:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:02] [INFO ] Invariant cache hit.
[2023-03-23 12:50:02] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-23 12:50:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:02] [INFO ] Invariant cache hit.
[2023-03-23 12:50:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:50:03] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-03-23 12:50:03] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-23 12:50:03] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:03] [INFO ] Invariant cache hit.
[2023-03-23 12:50:03] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1685 ms. Remains : 414/414 places, 1202/1202 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:50:03] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2096 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :1721
[2023-03-23 12:50:06] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-23 12:50:06] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-23 12:50:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:50:06] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-23 12:50:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:50:06] [INFO ] [Real]Added 74 Read/Feed constraints in 37 ms returned sat
[2023-03-23 12:50:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:50:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:50:07] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-23 12:50:07] [INFO ] [Nat]Added 74 Read/Feed constraints in 56 ms returned sat
[2023-03-23 12:50:07] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 1 ms to minimize.
[2023-03-23 12:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-23 12:50:07] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 69 ms.
[2023-03-23 12:50:07] [INFO ] Added : 5 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1751]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 40 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-23 12:50:10] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:10] [INFO ] Invariant cache hit.
[2023-03-23 12:50:10] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-23 12:50:10] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:10] [INFO ] Invariant cache hit.
[2023-03-23 12:50:10] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-23 12:50:11] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2023-03-23 12:50:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-23 12:50:11] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-23 12:50:11] [INFO ] Invariant cache hit.
[2023-03-23 12:50:12] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1793 ms. Remains : 414/414 places, 1202/1202 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 25605 ms.
[2023-03-23 12:50:12] [INFO ] Flatten gal took : 139 ms
[2023-03-23 12:50:12] [INFO ] Applying decomposition
[2023-03-23 12:50:12] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14426131322037817569.txt' '-o' '/tmp/graph14426131322037817569.bin' '-w' '/tmp/graph14426131322037817569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14426131322037817569.bin' '-l' '-1' '-v' '-w' '/tmp/graph14426131322037817569.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:50:12] [INFO ] Decomposing Gal with order
[2023-03-23 12:50:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:50:13] [INFO ] Removed a total of 2154 redundant transitions.
[2023-03-23 12:50:13] [INFO ] Flatten gal took : 131 ms
[2023-03-23 12:50:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 942 labels/synchronizations in 85 ms.
[2023-03-23 12:50:13] [INFO ] Time to serialize gal into /tmp/UpperBounds1869885623908546444.gal : 13 ms
[2023-03-23 12:50:13] [INFO ] Time to serialize properties into /tmp/UpperBounds16778372809618862226.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1869885623908546444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16778372809618862226.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16778372809618862226.prop.
Detected timeout of ITS tools.
[2023-03-23 13:10:49] [INFO ] Flatten gal took : 41 ms
[2023-03-23 13:10:49] [INFO ] Time to serialize gal into /tmp/UpperBounds7546434496857650550.gal : 7 ms
[2023-03-23 13:10:49] [INFO ] Time to serialize properties into /tmp/UpperBounds16786346412090190113.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7546434496857650550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16786346412090190113.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds16786346412090190113.prop.
Detected timeout of ITS tools.
[2023-03-23 13:31:25] [INFO ] Flatten gal took : 38 ms
[2023-03-23 13:31:25] [INFO ] Input system was already deterministic with 1252 transitions.
[2023-03-23 13:31:25] [INFO ] Transformed 434 places.
[2023-03-23 13:31:26] [INFO ] Transformed 1252 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-23 13:31:26] [INFO ] Time to serialize gal into /tmp/UpperBounds12941822429657368645.gal : 8 ms
[2023-03-23 13:31:26] [INFO ] Time to serialize properties into /tmp/UpperBounds7380403718074250383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12941822429657368645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7380403718074250383.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7380403718074250383.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 165020 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15693724 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c016, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850800741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;