About the Execution of 2023-gold for Szymanski-PT-b10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.155 | 3600000.00 | 3345535.00 | 198695.70 | 0 0 0 1 0 ? ? 1 0 0 10 0 10 0 0 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556700556.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Szymanski-PT-b10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556700556
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 11 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 Szymanski-PT-b10-UpperBounds-00
FORMULA_NAME Szymanski-PT-b10-UpperBounds-01
FORMULA_NAME Szymanski-PT-b10-UpperBounds-02
FORMULA_NAME Szymanski-PT-b10-UpperBounds-03
FORMULA_NAME Szymanski-PT-b10-UpperBounds-04
FORMULA_NAME Szymanski-PT-b10-UpperBounds-05
FORMULA_NAME Szymanski-PT-b10-UpperBounds-06
FORMULA_NAME Szymanski-PT-b10-UpperBounds-07
FORMULA_NAME Szymanski-PT-b10-UpperBounds-08
FORMULA_NAME Szymanski-PT-b10-UpperBounds-09
FORMULA_NAME Szymanski-PT-b10-UpperBounds-10
FORMULA_NAME Szymanski-PT-b10-UpperBounds-11
FORMULA_NAME Szymanski-PT-b10-UpperBounds-12
FORMULA_NAME Szymanski-PT-b10-UpperBounds-13
FORMULA_NAME Szymanski-PT-b10-UpperBounds-14
FORMULA_NAME Szymanski-PT-b10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717174053975
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 16:47:35] [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]
[2024-05-31 16:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:47:35] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2024-05-31 16:47:35] [INFO ] Transformed 568 places.
[2024-05-31 16:47:35] [INFO ] Transformed 8320 transitions.
[2024-05-31 16:47:36] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 562 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2024-05-31 16:47:36] [INFO ] Computed 3 invariants in 73 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :8
FORMULA Szymanski-PT-b10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :4
[2024-05-31 16:47:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-31 16:47:36] [INFO ] Computed 3 invariants in 26 ms
[2024-05-31 16:47:36] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 16:47:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 16:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:37] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-05-31 16:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 16:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:38] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2024-05-31 16:47:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:47:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:47:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 4225 ms returned unknown
[2024-05-31 16:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 16:47:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 16:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:42] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2024-05-31 16:47:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 16:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:43] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-31 16:47:44] [INFO ] [Nat]Added 147 Read/Feed constraints in 1000 ms returned sat
[2024-05-31 16:47:45] [INFO ] Deduced a trap composed of 134 places in 620 ms of which 3 ms to minimize.
[2024-05-31 16:47:45] [INFO ] Deduced a trap composed of 135 places in 592 ms of which 1 ms to minimize.
[2024-05-31 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1453 ms
[2024-05-31 16:47:46] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 638 ms.
[2024-05-31 16:47:46] [INFO ] Added : 0 causal constraints over 0 iterations in 835 ms. Result :sat
Minimization took 1138 ms.
[2024-05-31 16:47:47] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:47] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 16:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:48] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-05-31 16:47:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:48] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 16:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:48] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-31 16:47:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:47:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 4488 ms returned unknown
[2024-05-31 16:47:53] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-31 16:47:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 16:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:54] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2024-05-31 16:47:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:47:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:54] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 16:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:47:55] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-31 16:47:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:47:59] [INFO ] [Nat]Added 147 Read/Feed constraints in 4291 ms returned unknown
[2024-05-31 16:47:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:47:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 16:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:00] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-05-31 16:48:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 16:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:00] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-31 16:48:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 511 ms returned sat
[2024-05-31 16:48:01] [INFO ] Deduced a trap composed of 140 places in 595 ms of which 0 ms to minimize.
[2024-05-31 16:48:02] [INFO ] Deduced a trap composed of 145 places in 592 ms of which 2 ms to minimize.
[2024-05-31 16:48:03] [INFO ] Deduced a trap composed of 138 places in 561 ms of which 1 ms to minimize.
[2024-05-31 16:48:03] [INFO ] Deduced a trap composed of 134 places in 494 ms of which 0 ms to minimize.
[2024-05-31 16:48:04] [INFO ] Deduced a trap composed of 135 places in 562 ms of which 1 ms to minimize.
[2024-05-31 16:48:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3198 ms
[2024-05-31 16:48:05] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 568 ms.
[2024-05-31 16:48:05] [INFO ] Added : 0 causal constraints over 0 iterations in 741 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [21, 1, 21, 21, 1] Max seen :[9, 0, 8, 8, 0]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 499 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:48:05] [INFO ] Computed 3 invariants in 17 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 5) seen :28
FORMULA Szymanski-PT-b10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 4) seen :7
[2024-05-31 16:48:10] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:48:10] [INFO ] Computed 3 invariants in 31 ms
[2024-05-31 16:48:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:10] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-31 16:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:11] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-05-31 16:48:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:48:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:48:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 6061 ms returned unknown
[2024-05-31 16:48:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:17] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-31 16:48:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:18] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2024-05-31 16:48:19] [INFO ] [Nat]Added 147 Read/Feed constraints in 728 ms returned sat
[2024-05-31 16:48:19] [INFO ] Deduced a trap composed of 78 places in 556 ms of which 1 ms to minimize.
[2024-05-31 16:48:20] [INFO ] Deduced a trap composed of 129 places in 498 ms of which 0 ms to minimize.
[2024-05-31 16:48:20] [INFO ] Deduced a trap composed of 129 places in 538 ms of which 0 ms to minimize.
[2024-05-31 16:48:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1945 ms
[2024-05-31 16:48:21] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 326 ms.
[2024-05-31 16:48:21] [INFO ] Added : 3 causal constraints over 2 iterations in 676 ms. Result :sat
Minimization took 754 ms.
[2024-05-31 16:48:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:22] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2024-05-31 16:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:23] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-31 16:48:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:48:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 6041 ms returned unknown
[2024-05-31 16:48:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:30] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-31 16:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:30] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2024-05-31 16:48:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 2390 ms returned sat
[2024-05-31 16:48:33] [INFO ] Deduced a trap composed of 47 places in 545 ms of which 0 ms to minimize.
[2024-05-31 16:48:34] [INFO ] Deduced a trap composed of 38 places in 535 ms of which 0 ms to minimize.
[2024-05-31 16:48:34] [INFO ] Deduced a trap composed of 37 places in 499 ms of which 0 ms to minimize.
[2024-05-31 16:48:35] [INFO ] Deduced a trap composed of 139 places in 488 ms of which 0 ms to minimize.
[2024-05-31 16:48:35] [INFO ] Deduced a trap composed of 143 places in 482 ms of which 0 ms to minimize.
[2024-05-31 16:48:36] [INFO ] Deduced a trap composed of 135 places in 529 ms of which 0 ms to minimize.
[2024-05-31 16:48:36] [INFO ] Deduced a trap composed of 133 places in 533 ms of which 0 ms to minimize.
[2024-05-31 16:48:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4181 ms
[2024-05-31 16:48:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 472 ms.
[2024-05-31 16:48:37] [INFO ] Added : 0 causal constraints over 0 iterations in 642 ms. Result :sat
Minimization took 1393 ms.
Current structural bounds on expressions (after SMT) : [11, 1, 11, 1] Max seen :[10, 0, 8, 0]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 250 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:48:39] [INFO ] Computed 3 invariants in 26 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 4) seen :19
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 4) seen :9
[2024-05-31 16:48:44] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:48:44] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 16:48:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:44] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-05-31 16:48:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 16:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:45] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-05-31 16:48:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:48:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:48:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 6040 ms returned unknown
[2024-05-31 16:48:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:51] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-05-31 16:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:52] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-05-31 16:48:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 724 ms returned sat
[2024-05-31 16:48:53] [INFO ] Deduced a trap composed of 78 places in 508 ms of which 1 ms to minimize.
[2024-05-31 16:48:54] [INFO ] Deduced a trap composed of 129 places in 559 ms of which 1 ms to minimize.
[2024-05-31 16:48:55] [INFO ] Deduced a trap composed of 129 places in 555 ms of which 1 ms to minimize.
[2024-05-31 16:48:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1995 ms
[2024-05-31 16:48:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 353 ms.
[2024-05-31 16:48:55] [INFO ] Added : 3 causal constraints over 2 iterations in 677 ms. Result :sat
Minimization took 742 ms.
[2024-05-31 16:48:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:57] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-31 16:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:48:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:48:57] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-31 16:49:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:49:03] [INFO ] [Nat]Added 147 Read/Feed constraints in 6037 ms returned unknown
[2024-05-31 16:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:04] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-31 16:49:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:04] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2024-05-31 16:49:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 2539 ms returned sat
[2024-05-31 16:49:07] [INFO ] Deduced a trap composed of 47 places in 510 ms of which 0 ms to minimize.
[2024-05-31 16:49:08] [INFO ] Deduced a trap composed of 38 places in 549 ms of which 1 ms to minimize.
[2024-05-31 16:49:09] [INFO ] Deduced a trap composed of 37 places in 549 ms of which 0 ms to minimize.
[2024-05-31 16:49:09] [INFO ] Deduced a trap composed of 139 places in 550 ms of which 0 ms to minimize.
[2024-05-31 16:49:10] [INFO ] Deduced a trap composed of 143 places in 538 ms of which 0 ms to minimize.
[2024-05-31 16:49:10] [INFO ] Deduced a trap composed of 135 places in 534 ms of which 1 ms to minimize.
[2024-05-31 16:49:11] [INFO ] Deduced a trap composed of 133 places in 536 ms of which 1 ms to minimize.
[2024-05-31 16:49:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4331 ms
[2024-05-31 16:49:12] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 348 ms.
[2024-05-31 16:49:12] [INFO ] Added : 0 causal constraints over 0 iterations in 514 ms. Result :sat
Minimization took 1332 ms.
Current structural bounds on expressions (after SMT) : [11, 1, 11, 1] Max seen :[10, 0, 9, 0]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 305 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 213 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:49:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:49:14] [INFO ] Invariant cache hit.
[2024-05-31 16:49:14] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-31 16:49:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:49:14] [INFO ] Invariant cache hit.
[2024-05-31 16:49:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:49:18] [INFO ] Implicit Places using invariants and state equation in 3770 ms returned []
Implicit Place search using SMT with State Equation took 4293 ms to find 0 implicit places.
[2024-05-31 16:49:19] [INFO ] Redundant transitions in 932 ms returned []
[2024-05-31 16:49:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:49:19] [INFO ] Invariant cache hit.
[2024-05-31 16:49:22] [INFO ] Dead Transitions using invariants and state equation in 2414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7870 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:49:22] [INFO ] Computed 3 invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 4) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 4) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 4) seen :10
[2024-05-31 16:49:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:49:26] [INFO ] Computed 3 invariants in 21 ms
[2024-05-31 16:49:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:27] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-31 16:49:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:27] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-31 16:49:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:49:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:49:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 6052 ms returned unknown
[2024-05-31 16:49:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:34] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-31 16:49:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:34] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-31 16:49:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 690 ms returned sat
[2024-05-31 16:49:35] [INFO ] Deduced a trap composed of 78 places in 555 ms of which 0 ms to minimize.
[2024-05-31 16:49:36] [INFO ] Deduced a trap composed of 129 places in 550 ms of which 0 ms to minimize.
[2024-05-31 16:49:37] [INFO ] Deduced a trap composed of 129 places in 549 ms of which 1 ms to minimize.
[2024-05-31 16:49:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1986 ms
[2024-05-31 16:49:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 353 ms.
[2024-05-31 16:49:37] [INFO ] Added : 3 causal constraints over 2 iterations in 662 ms. Result :sat
Minimization took 711 ms.
[2024-05-31 16:49:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:39] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-31 16:49:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 16:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:39] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-31 16:49:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:49:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 6038 ms returned unknown
[2024-05-31 16:49:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:46] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-05-31 16:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:46] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-31 16:49:49] [INFO ] [Nat]Added 147 Read/Feed constraints in 2540 ms returned sat
[2024-05-31 16:49:49] [INFO ] Deduced a trap composed of 47 places in 516 ms of which 1 ms to minimize.
[2024-05-31 16:49:50] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 0 ms to minimize.
[2024-05-31 16:49:51] [INFO ] Deduced a trap composed of 37 places in 521 ms of which 1 ms to minimize.
[2024-05-31 16:49:51] [INFO ] Deduced a trap composed of 139 places in 506 ms of which 1 ms to minimize.
[2024-05-31 16:49:52] [INFO ] Deduced a trap composed of 143 places in 548 ms of which 4 ms to minimize.
[2024-05-31 16:49:52] [INFO ] Deduced a trap composed of 135 places in 528 ms of which 1 ms to minimize.
[2024-05-31 16:49:53] [INFO ] Deduced a trap composed of 133 places in 538 ms of which 1 ms to minimize.
[2024-05-31 16:49:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4224 ms
[2024-05-31 16:49:53] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 354 ms.
[2024-05-31 16:49:54] [INFO ] Added : 0 causal constraints over 0 iterations in 516 ms. Result :sat
Minimization took 1330 ms.
Current structural bounds on expressions (after SMT) : [11, 1, 11, 1] Max seen :[10, 0, 10, 0]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:49:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:49:56] [INFO ] Invariant cache hit.
[2024-05-31 16:49:56] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-31 16:49:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:49:56] [INFO ] Invariant cache hit.
[2024-05-31 16:49:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:49:59] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2024-05-31 16:50:00] [INFO ] Redundant transitions in 889 ms returned []
[2024-05-31 16:50:00] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:00] [INFO ] Invariant cache hit.
[2024-05-31 16:50:02] [INFO ] Dead Transitions using invariants and state equation in 2251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6564 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:02] [INFO ] Computed 3 invariants in 22 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 4) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 4) seen :8
[2024-05-31 16:50:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:06] [INFO ] Computed 3 invariants in 21 ms
[2024-05-31 16:50:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:07] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2024-05-31 16:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:07] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-31 16:50:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:50:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:50:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 6037 ms returned unknown
[2024-05-31 16:50:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:14] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2024-05-31 16:50:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:14] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-31 16:50:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 791 ms returned sat
[2024-05-31 16:50:16] [INFO ] Deduced a trap composed of 78 places in 552 ms of which 0 ms to minimize.
[2024-05-31 16:50:16] [INFO ] Deduced a trap composed of 129 places in 545 ms of which 1 ms to minimize.
[2024-05-31 16:50:17] [INFO ] Deduced a trap composed of 129 places in 565 ms of which 1 ms to minimize.
[2024-05-31 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2014 ms
[2024-05-31 16:50:17] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 360 ms.
[2024-05-31 16:50:18] [INFO ] Added : 3 causal constraints over 2 iterations in 681 ms. Result :sat
Minimization took 723 ms.
[2024-05-31 16:50:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:19] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-31 16:50:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:20] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-31 16:50:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:50:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 6038 ms returned unknown
[2024-05-31 16:50:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:26] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-31 16:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:27] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-31 16:50:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 2354 ms returned sat
[2024-05-31 16:50:29] [INFO ] Deduced a trap composed of 47 places in 546 ms of which 0 ms to minimize.
[2024-05-31 16:50:30] [INFO ] Deduced a trap composed of 38 places in 523 ms of which 1 ms to minimize.
[2024-05-31 16:50:31] [INFO ] Deduced a trap composed of 37 places in 503 ms of which 0 ms to minimize.
[2024-05-31 16:50:31] [INFO ] Deduced a trap composed of 139 places in 494 ms of which 1 ms to minimize.
[2024-05-31 16:50:32] [INFO ] Deduced a trap composed of 143 places in 499 ms of which 1 ms to minimize.
[2024-05-31 16:50:32] [INFO ] Deduced a trap composed of 135 places in 534 ms of which 0 ms to minimize.
[2024-05-31 16:50:33] [INFO ] Deduced a trap composed of 133 places in 533 ms of which 1 ms to minimize.
[2024-05-31 16:50:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4183 ms
[2024-05-31 16:50:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 348 ms.
[2024-05-31 16:50:34] [INFO ] Added : 0 causal constraints over 0 iterations in 507 ms. Result :sat
Minimization took 1378 ms.
Current structural bounds on expressions (after SMT) : [11, 1, 11, 1] Max seen :[10, 0, 10, 0]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:50:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:36] [INFO ] Invariant cache hit.
[2024-05-31 16:50:36] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-31 16:50:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:36] [INFO ] Invariant cache hit.
[2024-05-31 16:50:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:50:38] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
[2024-05-31 16:50:39] [INFO ] Redundant transitions in 660 ms returned []
[2024-05-31 16:50:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:39] [INFO ] Invariant cache hit.
[2024-05-31 16:50:41] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5870 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-05
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:41] [INFO ] Computed 3 invariants in 22 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :10
[2024-05-31 16:50:41] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:41] [INFO ] Computed 3 invariants in 22 ms
[2024-05-31 16:50:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:42] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-31 16:50:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:43] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-31 16:50:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:50:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:50:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 4526 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[10]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:47] [INFO ] Computed 3 invariants in 25 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 1) seen :10
[2024-05-31 16:50:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:50:49] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 16:50:49] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:50] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2024-05-31 16:50:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:50:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:50:50] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-31 16:50:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:50:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:50:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 6043 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[10]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:50:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:56] [INFO ] Invariant cache hit.
[2024-05-31 16:50:57] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-31 16:50:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:50:57] [INFO ] Invariant cache hit.
[2024-05-31 16:50:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:50:59] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2024-05-31 16:51:00] [INFO ] Redundant transitions in 697 ms returned []
[2024-05-31 16:51:00] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:00] [INFO ] Invariant cache hit.
[2024-05-31 16:51:02] [INFO ] Dead Transitions using invariants and state equation in 2244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5960 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-05 in 20869 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-06
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:02] [INFO ] Computed 3 invariants in 20 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-31 16:51:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:02] [INFO ] Computed 3 invariants in 17 ms
[2024-05-31 16:51:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:03] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-31 16:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:03] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-31 16:51:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:04] [INFO ] [Nat]Added 147 Read/Feed constraints in 722 ms returned sat
[2024-05-31 16:51:05] [INFO ] Deduced a trap composed of 78 places in 565 ms of which 1 ms to minimize.
[2024-05-31 16:51:05] [INFO ] Deduced a trap composed of 129 places in 509 ms of which 0 ms to minimize.
[2024-05-31 16:51:06] [INFO ] Deduced a trap composed of 129 places in 517 ms of which 0 ms to minimize.
[2024-05-31 16:51:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1934 ms
[2024-05-31 16:51:06] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 342 ms.
[2024-05-31 16:51:07] [INFO ] Added : 3 causal constraints over 2 iterations in 653 ms. Result :sat
Minimization took 730 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:08] [INFO ] Computed 3 invariants in 20 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 1) seen :0
[2024-05-31 16:51:09] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:09] [INFO ] Computed 3 invariants in 18 ms
[2024-05-31 16:51:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:10] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2024-05-31 16:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:10] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-05-31 16:51:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 722 ms returned sat
[2024-05-31 16:51:12] [INFO ] Deduced a trap composed of 78 places in 527 ms of which 3 ms to minimize.
[2024-05-31 16:51:12] [INFO ] Deduced a trap composed of 129 places in 498 ms of which 0 ms to minimize.
[2024-05-31 16:51:13] [INFO ] Deduced a trap composed of 129 places in 513 ms of which 1 ms to minimize.
[2024-05-31 16:51:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1883 ms
[2024-05-31 16:51:13] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 329 ms.
[2024-05-31 16:51:14] [INFO ] Added : 3 causal constraints over 2 iterations in 669 ms. Result :sat
Minimization took 811 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:51:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:15] [INFO ] Invariant cache hit.
[2024-05-31 16:51:16] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-31 16:51:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:16] [INFO ] Invariant cache hit.
[2024-05-31 16:51:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:18] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2024-05-31 16:51:18] [INFO ] Redundant transitions in 664 ms returned []
[2024-05-31 16:51:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:18] [INFO ] Invariant cache hit.
[2024-05-31 16:51:20] [INFO ] Dead Transitions using invariants and state equation in 2243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5457 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-06 in 18191 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-10
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:20] [INFO ] Computed 3 invariants in 19 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
[2024-05-31 16:51:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:21] [INFO ] Computed 3 invariants in 19 ms
[2024-05-31 16:51:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:21] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-05-31 16:51:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:21] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-31 16:51:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:51:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 4569 ms returned unknown
Current structural bounds on expressions (after SMT) : [11] Max seen :[10]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 208 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:26] [INFO ] Computed 3 invariants in 14 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :10
[2024-05-31 16:51:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:28] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 16:51:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:28] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-31 16:51:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:29] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2024-05-31 16:51:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 16:51:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 5144 ms returned sat
[2024-05-31 16:51:35] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 0 ms to minimize.
[2024-05-31 16:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 551 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[10]
FORMULA Szymanski-PT-b10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-10 in 14085 ms.
Starting property specific reduction for Szymanski-PT-b10-UpperBounds-15
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:35] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2024-05-31 16:51:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:35] [INFO ] Computed 3 invariants in 15 ms
[2024-05-31 16:51:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:35] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-05-31 16:51:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:36] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-31 16:51:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 2333 ms returned sat
[2024-05-31 16:51:38] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 1 ms to minimize.
[2024-05-31 16:51:39] [INFO ] Deduced a trap composed of 38 places in 506 ms of which 15 ms to minimize.
[2024-05-31 16:51:40] [INFO ] Deduced a trap composed of 37 places in 477 ms of which 0 ms to minimize.
[2024-05-31 16:51:40] [INFO ] Deduced a trap composed of 139 places in 493 ms of which 0 ms to minimize.
[2024-05-31 16:51:41] [INFO ] Deduced a trap composed of 30 places in 540 ms of which 0 ms to minimize.
[2024-05-31 16:51:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:41] [INFO ] Computed 3 invariants in 23 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 1) seen :0
[2024-05-31 16:51:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 16:51:42] [INFO ] Computed 3 invariants in 21 ms
[2024-05-31 16:51:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 16:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:43] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-31 16:51:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:51:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 16:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:51:43] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-31 16:51:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 2328 ms returned sat
[2024-05-31 16:51:46] [INFO ] Deduced a trap composed of 47 places in 548 ms of which 0 ms to minimize.
[2024-05-31 16:51:47] [INFO ] Deduced a trap composed of 38 places in 480 ms of which 0 ms to minimize.
[2024-05-31 16:51:47] [INFO ] Deduced a trap composed of 37 places in 481 ms of which 0 ms to minimize.
[2024-05-31 16:51:48] [INFO ] Deduced a trap composed of 139 places in 538 ms of which 0 ms to minimize.
[2024-05-31 16:51:48] [INFO ] Deduced a trap composed of 143 places in 485 ms of which 0 ms to minimize.
[2024-05-31 16:51:49] [INFO ] Deduced a trap composed of 135 places in 535 ms of which 0 ms to minimize.
[2024-05-31 16:51:50] [INFO ] Deduced a trap composed of 133 places in 541 ms of which 1 ms to minimize.
[2024-05-31 16:51:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4140 ms
[2024-05-31 16:51:50] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 329 ms.
[2024-05-31 16:51:50] [INFO ] Added : 0 causal constraints over 0 iterations in 489 ms. Result :sat
Minimization took 1376 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 16:51:52] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:52] [INFO ] Invariant cache hit.
[2024-05-31 16:51:53] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-31 16:51:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:53] [INFO ] Invariant cache hit.
[2024-05-31 16:51:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 16:51:55] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
[2024-05-31 16:51:55] [INFO ] Redundant transitions in 666 ms returned []
[2024-05-31 16:51:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 16:51:55] [INFO ] Invariant cache hit.
[2024-05-31 16:51:58] [INFO ] Dead Transitions using invariants and state equation in 2283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5766 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b10-UpperBounds-15 in 23245 ms.
[2024-05-31 16:51:58] [INFO ] Flatten gal took : 503 ms
[2024-05-31 16:51:59] [INFO ] Applying decomposition
[2024-05-31 16:51:59] [INFO ] Flatten gal took : 277 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17409259752367581399.txt' '-o' '/tmp/graph17409259752367581399.bin' '-w' '/tmp/graph17409259752367581399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17409259752367581399.bin' '-l' '-1' '-v' '-w' '/tmp/graph17409259752367581399.weights' '-q' '0' '-e' '0.001'
[2024-05-31 16:52:00] [INFO ] Decomposing Gal with order
[2024-05-31 16:52:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 16:52:00] [INFO ] Removed a total of 18130 redundant transitions.
[2024-05-31 16:52:01] [INFO ] Flatten gal took : 806 ms
[2024-05-31 16:52:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1122 labels/synchronizations in 302 ms.
[2024-05-31 16:52:01] [INFO ] Time to serialize gal into /tmp/UpperBounds7212334017929110588.gal : 60 ms
[2024-05-31 16:52:01] [INFO ] Time to serialize properties into /tmp/UpperBounds10007954220960989913.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7212334017929110588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10007954220960989913.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds10007954220960989913.prop.
Detected timeout of ITS tools.
[2024-05-31 17:13:32] [INFO ] Flatten gal took : 1565 ms
[2024-05-31 17:13:32] [INFO ] Time to serialize gal into /tmp/UpperBounds4936186147167881073.gal : 106 ms
[2024-05-31 17:13:32] [INFO ] Time to serialize properties into /tmp/UpperBounds12695599786930146599.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4936186147167881073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12695599786930146599.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds12695599786930146599.prop.
Detected timeout of ITS tools.
[2024-05-31 17:35:22] [INFO ] Flatten gal took : 1437 ms
[2024-05-31 17:35:34] [INFO ] Input system was already deterministic with 7808 transitions.
[2024-05-31 17:35:34] [INFO ] Transformed 305 places.
[2024-05-31 17:35:34] [INFO ] Transformed 7808 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
[2024-05-31 17:35:35] [INFO ] Time to serialize gal into /tmp/UpperBounds8172123957091516942.gal : 79 ms
[2024-05-31 17:35:35] [INFO ] Time to serialize properties into /tmp/UpperBounds2768785518136448410.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8172123957091516942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2768785518136448410.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2768785518136448410.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3483572 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16249496 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Szymanski-PT-b10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Szymanski-PT-b10, 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 r417-tall-171690556700556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b10.tgz
mv Szymanski-PT-b10 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 ;