About the Execution of GreatSPN+red for Anderson-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9157.752 | 3600000.00 | 13657797.00 | 812.20 | 1 1 1 1 1 1 1 ? 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r003-smll-171620117600373.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 greatspnxred
Input is Anderson-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-11-UpperBounds-00
FORMULA_NAME Anderson-PT-11-UpperBounds-01
FORMULA_NAME Anderson-PT-11-UpperBounds-02
FORMULA_NAME Anderson-PT-11-UpperBounds-03
FORMULA_NAME Anderson-PT-11-UpperBounds-04
FORMULA_NAME Anderson-PT-11-UpperBounds-05
FORMULA_NAME Anderson-PT-11-UpperBounds-06
FORMULA_NAME Anderson-PT-11-UpperBounds-07
FORMULA_NAME Anderson-PT-11-UpperBounds-08
FORMULA_NAME Anderson-PT-11-UpperBounds-09
FORMULA_NAME Anderson-PT-11-UpperBounds-10
FORMULA_NAME Anderson-PT-11-UpperBounds-11
FORMULA_NAME Anderson-PT-11-UpperBounds-12
FORMULA_NAME Anderson-PT-11-UpperBounds-13
FORMULA_NAME Anderson-PT-11-UpperBounds-14
FORMULA_NAME Anderson-PT-11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716464435954
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 11:40:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 11:40:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:40:39] [INFO ] Load time of PNML (sax parser for PT used): 643 ms
[2024-05-23 11:40:39] [INFO ] Transformed 749 places.
[2024-05-23 11:40:39] [INFO ] Transformed 3245 transitions.
[2024-05-23 11:40:39] [INFO ] Found NUPN structural information;
[2024-05-23 11:40:39] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 1075 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Anderson-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3245 rows 749 cols
[2024-05-23 11:40:39] [INFO ] Computed 25 invariants in 135 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 152 ms. (65 steps per ms)
FORMULA Anderson-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (4 resets) in 92 ms. (215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-23 11:40:39] [INFO ] Invariant cache hit.
[2024-05-23 11:40:40] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2024-05-23 11:40:40] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 25 ms returned sat
[2024-05-23 11:40:43] [INFO ] [Real]Absence check using state equation in 2640 ms returned sat
[2024-05-23 11:40:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:40:43] [INFO ] [Real]Added 110 Read/Feed constraints in 375 ms returned sat
[2024-05-23 11:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:40:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 36 ms returned sat
[2024-05-23 11:40:44] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 26 ms returned sat
[2024-05-23 11:40:47] [INFO ] [Nat]Absence check using state equation in 2800 ms returned sat
[2024-05-23 11:40:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-23 11:40:47] [INFO ] [Nat]Added 110 Read/Feed constraints in 767 ms returned sat
[2024-05-23 11:40:49] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 816 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-23 11:40:49] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 11:40:49] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 23 ms returned sat
[2024-05-23 11:40:50] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2024-05-23 11:40:51] [INFO ] [Real]Added 110 Read/Feed constraints in 228 ms returned sat
[2024-05-23 11:40:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:40:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 37 ms returned sat
[2024-05-23 11:40:51] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 17 ms returned sat
[2024-05-23 11:40:54] [INFO ] [Nat]Absence check using state equation in 2773 ms returned sat
[2024-05-23 11:40:54] [INFO ] [Nat]Added 110 Read/Feed constraints in 366 ms returned sat
[2024-05-23 11:40:55] [INFO ] Computed and/alt/rep : 132/143/132 causal constraints (skipped 3102 transitions) in 893 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 108 Pre rules applied. Total rules applied 0 place count 749 transition count 3137
Deduced a syphon composed of 108 places in 8 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 0 with 216 rules applied. Total rules applied 216 place count 641 transition count 3137
Discarding 218 places :
Symmetric choice reduction at 0 with 218 rule applications. Total rules 434 place count 423 transition count 719
Iterating global reduction 0 with 218 rules applied. Total rules applied 652 place count 423 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 656 place count 421 transition count 717
Applied a total of 656 rules in 444 ms. Remains 421 /749 variables (removed 328) and now considering 717/3245 (removed 2528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 421/749 places, 717/3245 transitions.
// Phase 1: matrix 717 rows 421 cols
[2024-05-23 11:40:56] [INFO ] Computed 25 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3036 ms. (329 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 3075 ms. (650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-23 11:41:03] [INFO ] Invariant cache hit.
[2024-05-23 11:41:03] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2024-05-23 11:41:03] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 24 ms returned sat
[2024-05-23 11:41:03] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-23 11:41:03] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:41:04] [INFO ] [Real]Added 110 Read/Feed constraints in 141 ms returned sat
[2024-05-23 11:41:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:41:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2024-05-23 11:41:04] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 33 ms returned sat
[2024-05-23 11:41:04] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2024-05-23 11:41:05] [INFO ] [Nat]Added 110 Read/Feed constraints in 241 ms returned sat
[2024-05-23 11:41:05] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 682 transitions) in 83 ms.
[2024-05-23 11:41:05] [INFO ] Added : 0 causal constraints over 0 iterations in 181 ms. Result :sat
Minimization took 788 ms.
[2024-05-23 11:41:06] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2024-05-23 11:41:06] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 25 ms returned sat
[2024-05-23 11:41:07] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-05-23 11:41:07] [INFO ] [Real]Added 110 Read/Feed constraints in 30 ms returned sat
[2024-05-23 11:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:41:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-05-23 11:41:07] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 22 ms returned sat
[2024-05-23 11:41:07] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2024-05-23 11:41:07] [INFO ] [Nat]Added 110 Read/Feed constraints in 74 ms returned sat
[2024-05-23 11:41:08] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 682 transitions) in 136 ms.
[2024-05-23 11:41:09] [INFO ] Deduced a trap composed of 99 places in 617 ms of which 71 ms to minimize.
[2024-05-23 11:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 746 ms
[2024-05-23 11:41:09] [INFO ] Added : 2 causal constraints over 1 iterations in 1252 ms. Result :sat
Minimization took 668 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 717/717 transitions.
Applied a total of 0 rules in 65 ms. Remains 421 /421 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 421/421 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 717/717 transitions.
Applied a total of 0 rules in 65 ms. Remains 421 /421 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-23 11:41:10] [INFO ] Invariant cache hit.
[2024-05-23 11:41:11] [INFO ] Implicit Places using invariants in 977 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 981 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/421 places, 717/717 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 420 transition count 596
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 299 transition count 596
Applied a total of 242 rules in 36 ms. Remains 299 /420 variables (removed 121) and now considering 596/717 (removed 121) transitions.
// Phase 1: matrix 596 rows 299 cols
[2024-05-23 11:41:11] [INFO ] Computed 24 invariants in 6 ms
[2024-05-23 11:41:11] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-23 11:41:11] [INFO ] Invariant cache hit.
[2024-05-23 11:41:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:41:13] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 299/421 places, 596/717 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3249 ms. Remains : 299/421 places, 596/717 transitions.
[2024-05-23 11:41:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2351 ms. (425 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1579 ms. (1265 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-23 11:41:17] [INFO ] Invariant cache hit.
[2024-05-23 11:41:17] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-23 11:41:17] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2024-05-23 11:41:17] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-23 11:41:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:41:17] [INFO ] [Real]Added 110 Read/Feed constraints in 40 ms returned sat
[2024-05-23 11:41:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:41:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-23 11:41:18] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-23 11:41:18] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-23 11:41:18] [INFO ] [Nat]Added 110 Read/Feed constraints in 56 ms returned sat
[2024-05-23 11:41:18] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 561 transitions) in 79 ms.
[2024-05-23 11:41:18] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 473 ms.
[2024-05-23 11:41:19] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-23 11:41:19] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 22 ms returned sat
[2024-05-23 11:41:19] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-05-23 11:41:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:41:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 11:41:19] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2024-05-23 11:41:19] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-23 11:41:20] [INFO ] [Nat]Added 110 Read/Feed constraints in 56 ms returned sat
[2024-05-23 11:41:20] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 561 transitions) in 71 ms.
[2024-05-23 11:41:20] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 596/596 transitions.
Applied a total of 0 rules in 28 ms. Remains 299 /299 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 299/299 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 596/596 transitions.
Applied a total of 0 rules in 26 ms. Remains 299 /299 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-05-23 11:41:20] [INFO ] Invariant cache hit.
[2024-05-23 11:41:21] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-23 11:41:21] [INFO ] Invariant cache hit.
[2024-05-23 11:41:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:41:22] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-23 11:41:22] [INFO ] Redundant transitions in 45 ms returned []
Running 585 sub problems to find dead transitions.
[2024-05-23 11:41:22] [INFO ] Invariant cache hit.
[2024-05-23 11:41:22] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-05-23 11:41:33] [INFO ] Deduced a trap composed of 105 places in 293 ms of which 6 ms to minimize.
[2024-05-23 11:41:34] [INFO ] Deduced a trap composed of 113 places in 406 ms of which 5 ms to minimize.
[2024-05-23 11:41:34] [INFO ] Deduced a trap composed of 94 places in 421 ms of which 12 ms to minimize.
[2024-05-23 11:41:35] [INFO ] Deduced a trap composed of 98 places in 418 ms of which 5 ms to minimize.
[2024-05-23 11:41:36] [INFO ] Deduced a trap composed of 159 places in 408 ms of which 5 ms to minimize.
[2024-05-23 11:41:36] [INFO ] Deduced a trap composed of 121 places in 428 ms of which 5 ms to minimize.
[2024-05-23 11:41:37] [INFO ] Deduced a trap composed of 121 places in 405 ms of which 6 ms to minimize.
[2024-05-23 11:41:37] [INFO ] Deduced a trap composed of 116 places in 401 ms of which 5 ms to minimize.
[2024-05-23 11:41:37] [INFO ] Deduced a trap composed of 86 places in 392 ms of which 5 ms to minimize.
[2024-05-23 11:41:38] [INFO ] Deduced a trap composed of 113 places in 403 ms of which 5 ms to minimize.
[2024-05-23 11:41:38] [INFO ] Deduced a trap composed of 111 places in 390 ms of which 5 ms to minimize.
[2024-05-23 11:41:39] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 6 ms to minimize.
[2024-05-23 11:41:39] [INFO ] Deduced a trap composed of 108 places in 390 ms of which 5 ms to minimize.
[2024-05-23 11:41:40] [INFO ] Deduced a trap composed of 101 places in 385 ms of which 5 ms to minimize.
[2024-05-23 11:41:40] [INFO ] Deduced a trap composed of 101 places in 387 ms of which 5 ms to minimize.
[2024-05-23 11:41:40] [INFO ] Deduced a trap composed of 89 places in 383 ms of which 5 ms to minimize.
[2024-05-23 11:41:41] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 5 ms to minimize.
[2024-05-23 11:41:41] [INFO ] Deduced a trap composed of 103 places in 352 ms of which 5 ms to minimize.
[2024-05-23 11:41:41] [INFO ] Deduced a trap composed of 91 places in 395 ms of which 5 ms to minimize.
[2024-05-23 11:41:42] [INFO ] Deduced a trap composed of 79 places in 402 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-05-23 11:41:48] [INFO ] Deduced a trap composed of 79 places in 399 ms of which 6 ms to minimize.
[2024-05-23 11:41:48] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 6 ms to minimize.
[2024-05-23 11:41:49] [INFO ] Deduced a trap composed of 93 places in 393 ms of which 6 ms to minimize.
[2024-05-23 11:41:49] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 6 ms to minimize.
[2024-05-23 11:41:50] [INFO ] Deduced a trap composed of 92 places in 335 ms of which 5 ms to minimize.
[2024-05-23 11:41:50] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 6 ms to minimize.
[2024-05-23 11:41:50] [INFO ] Deduced a trap composed of 89 places in 416 ms of which 5 ms to minimize.
[2024-05-23 11:41:51] [INFO ] Deduced a trap composed of 78 places in 407 ms of which 5 ms to minimize.
[2024-05-23 11:41:51] [INFO ] Deduced a trap composed of 78 places in 425 ms of which 5 ms to minimize.
[2024-05-23 11:41:52] [INFO ] Deduced a trap composed of 72 places in 426 ms of which 5 ms to minimize.
[2024-05-23 11:41:52] [INFO ] Deduced a trap composed of 64 places in 412 ms of which 5 ms to minimize.
[2024-05-23 11:41:53] [INFO ] Deduced a trap composed of 72 places in 353 ms of which 4 ms to minimize.
[2024-05-23 11:41:53] [INFO ] Deduced a trap composed of 84 places in 403 ms of which 5 ms to minimize.
SMT process timed out in 30835ms, After SMT, problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 30866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32954 ms. Remains : 299/299 places, 596/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 1794 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 247618 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :2 out of 4
Probabilistic random walk after 247618 steps, saw 191159 distinct states, run finished after 3013 ms. (steps per millisecond=82 ) properties seen :2
[2024-05-23 11:41:57] [INFO ] Invariant cache hit.
[2024-05-23 11:41:57] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/277 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 596/895 variables, 299/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/895 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/895 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 895/895 variables, and 433 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/277 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/299 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 596/895 variables, 299/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 110/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/895 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/895 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/895 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 895/895 variables, and 435 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 299/299 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1914ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 596/596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 595
Applied a total of 2 rules in 34 ms. Remains 298 /299 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 298/299 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 367203 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 2
Probabilistic random walk after 367203 steps, saw 281170 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
// Phase 1: matrix 595 rows 298 cols
[2024-05-23 11:42:02] [INFO ] Computed 24 invariants in 9 ms
[2024-05-23 11:42:02] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/893 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/893 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/893 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 434 constraints, problems are : Problem set: 0 solved, 2 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1088ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 298/298 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 13 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 11:42:03] [INFO ] Invariant cache hit.
[2024-05-23 11:42:04] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-23 11:42:04] [INFO ] Invariant cache hit.
[2024-05-23 11:42:04] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:42:06] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2362 ms to find 0 implicit places.
[2024-05-23 11:42:06] [INFO ] Redundant transitions in 15 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 11:42:06] [INFO ] Invariant cache hit.
[2024-05-23 11:42:06] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 11:42:16] [INFO ] Deduced a trap composed of 87 places in 413 ms of which 9 ms to minimize.
[2024-05-23 11:42:18] [INFO ] Deduced a trap composed of 122 places in 426 ms of which 6 ms to minimize.
[2024-05-23 11:42:18] [INFO ] Deduced a trap composed of 115 places in 413 ms of which 5 ms to minimize.
[2024-05-23 11:42:19] [INFO ] Deduced a trap composed of 83 places in 385 ms of which 5 ms to minimize.
[2024-05-23 11:42:19] [INFO ] Deduced a trap composed of 147 places in 418 ms of which 5 ms to minimize.
[2024-05-23 11:42:20] [INFO ] Deduced a trap composed of 128 places in 353 ms of which 4 ms to minimize.
[2024-05-23 11:42:20] [INFO ] Deduced a trap composed of 131 places in 385 ms of which 6 ms to minimize.
[2024-05-23 11:42:20] [INFO ] Deduced a trap composed of 89 places in 415 ms of which 5 ms to minimize.
[2024-05-23 11:42:21] [INFO ] Deduced a trap composed of 106 places in 321 ms of which 5 ms to minimize.
[2024-05-23 11:42:21] [INFO ] Deduced a trap composed of 91 places in 405 ms of which 5 ms to minimize.
[2024-05-23 11:42:22] [INFO ] Deduced a trap composed of 91 places in 392 ms of which 6 ms to minimize.
[2024-05-23 11:42:22] [INFO ] Deduced a trap composed of 93 places in 396 ms of which 5 ms to minimize.
[2024-05-23 11:42:22] [INFO ] Deduced a trap composed of 76 places in 394 ms of which 5 ms to minimize.
[2024-05-23 11:42:23] [INFO ] Deduced a trap composed of 96 places in 387 ms of which 5 ms to minimize.
[2024-05-23 11:42:23] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 5 ms to minimize.
[2024-05-23 11:42:24] [INFO ] Deduced a trap composed of 97 places in 331 ms of which 4 ms to minimize.
[2024-05-23 11:42:24] [INFO ] Deduced a trap composed of 83 places in 401 ms of which 7 ms to minimize.
[2024-05-23 11:42:24] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 5 ms to minimize.
[2024-05-23 11:42:25] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 5 ms to minimize.
[2024-05-23 11:42:25] [INFO ] Deduced a trap composed of 100 places in 427 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 11:42:30] [INFO ] Deduced a trap composed of 82 places in 428 ms of which 5 ms to minimize.
[2024-05-23 11:42:30] [INFO ] Deduced a trap composed of 75 places in 411 ms of which 6 ms to minimize.
[2024-05-23 11:42:31] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 7 ms to minimize.
[2024-05-23 11:42:31] [INFO ] Deduced a trap composed of 87 places in 422 ms of which 5 ms to minimize.
[2024-05-23 11:42:32] [INFO ] Deduced a trap composed of 77 places in 409 ms of which 5 ms to minimize.
[2024-05-23 11:42:32] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 5 ms to minimize.
[2024-05-23 11:42:33] [INFO ] Deduced a trap composed of 149 places in 427 ms of which 5 ms to minimize.
[2024-05-23 11:42:33] [INFO ] Deduced a trap composed of 116 places in 402 ms of which 6 ms to minimize.
[2024-05-23 11:42:33] [INFO ] Deduced a trap composed of 92 places in 411 ms of which 5 ms to minimize.
[2024-05-23 11:42:34] [INFO ] Deduced a trap composed of 106 places in 419 ms of which 5 ms to minimize.
[2024-05-23 11:42:34] [INFO ] Deduced a trap composed of 76 places in 406 ms of which 5 ms to minimize.
[2024-05-23 11:42:35] [INFO ] Deduced a trap composed of 84 places in 404 ms of which 5 ms to minimize.
[2024-05-23 11:42:35] [INFO ] Deduced a trap composed of 110 places in 379 ms of which 5 ms to minimize.
[2024-05-23 11:42:36] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 5 ms to minimize.
[2024-05-23 11:42:37] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 6 ms to minimize.
SMT process timed out in 31073ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 31091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33497 ms. Remains : 298/298 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 474
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 474
Applied a total of 242 rules in 28 ms. Remains 177 /298 variables (removed 121) and now considering 474/595 (removed 121) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 474 rows 177 cols
[2024-05-23 11:42:37] [INFO ] Computed 24 invariants in 8 ms
[2024-05-23 11:42:37] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 11:42:37] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-23 11:42:37] [INFO ] After 302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 11:42:37] [INFO ] After 398ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-23 11:42:37] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 619 ms.
FORMULA Anderson-PT-11-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for Anderson-PT-11-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 596 rows 299 cols
[2024-05-23 11:42:37] [INFO ] Computed 24 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 11:42:38] [INFO ] Invariant cache hit.
[2024-05-23 11:42:38] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-23 11:42:38] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2024-05-23 11:42:38] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-23 11:42:38] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:42:38] [INFO ] [Real]Added 110 Read/Feed constraints in 38 ms returned sat
[2024-05-23 11:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:42:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-23 11:42:38] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 17 ms returned sat
[2024-05-23 11:42:39] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-23 11:42:39] [INFO ] [Nat]Added 110 Read/Feed constraints in 53 ms returned sat
[2024-05-23 11:42:39] [INFO ] Computed and/alt/rep : 24/35/24 causal constraints (skipped 561 transitions) in 77 ms.
[2024-05-23 11:42:39] [INFO ] Added : 0 causal constraints over 0 iterations in 161 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 299 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1_9_20) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 595/595 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 594
Applied a total of 2 rules in 19 ms. Remains 298 /299 variables (removed 1) and now considering 594/595 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 298/299 places, 594/595 transitions.
// Phase 1: matrix 594 rows 298 cols
[2024-05-23 11:42:39] [INFO ] Computed 24 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1859 ms. (537 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 832 ms. (1200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-23 11:42:42] [INFO ] Invariant cache hit.
[2024-05-23 11:42:42] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-23 11:42:42] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 24 ms returned sat
[2024-05-23 11:42:43] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-23 11:42:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:42:43] [INFO ] [Real]Added 110 Read/Feed constraints in 39 ms returned sat
[2024-05-23 11:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:42:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-23 11:42:43] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 19 ms returned sat
[2024-05-23 11:42:43] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-23 11:42:43] [INFO ] [Nat]Added 110 Read/Feed constraints in 50 ms returned sat
[2024-05-23 11:42:43] [INFO ] Computed and/alt/rep : 22/33/22 causal constraints (skipped 561 transitions) in 73 ms.
[2024-05-23 11:42:44] [INFO ] Deduced a trap composed of 54 places in 413 ms of which 5 ms to minimize.
[2024-05-23 11:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2024-05-23 11:42:44] [INFO ] Added : 2 causal constraints over 2 iterations in 841 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 298/298 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-23 11:42:45] [INFO ] Invariant cache hit.
[2024-05-23 11:42:45] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-23 11:42:45] [INFO ] Invariant cache hit.
[2024-05-23 11:42:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:42:47] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2024-05-23 11:42:47] [INFO ] Redundant transitions in 5 ms returned []
Running 583 sub problems to find dead transitions.
[2024-05-23 11:42:47] [INFO ] Invariant cache hit.
[2024-05-23 11:42:47] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-05-23 11:43:09] [INFO ] Deduced a trap composed of 116 places in 292 ms of which 4 ms to minimize.
[2024-05-23 11:43:10] [INFO ] Deduced a trap composed of 85 places in 264 ms of which 3 ms to minimize.
[2024-05-23 11:43:10] [INFO ] Deduced a trap composed of 77 places in 274 ms of which 4 ms to minimize.
[2024-05-23 11:43:10] [INFO ] Deduced a trap composed of 113 places in 305 ms of which 4 ms to minimize.
[2024-05-23 11:43:11] [INFO ] Deduced a trap composed of 99 places in 317 ms of which 5 ms to minimize.
[2024-05-23 11:43:11] [INFO ] Deduced a trap composed of 102 places in 297 ms of which 4 ms to minimize.
[2024-05-23 11:43:11] [INFO ] Deduced a trap composed of 102 places in 337 ms of which 4 ms to minimize.
[2024-05-23 11:43:12] [INFO ] Deduced a trap composed of 105 places in 353 ms of which 5 ms to minimize.
[2024-05-23 11:43:12] [INFO ] Deduced a trap composed of 83 places in 372 ms of which 5 ms to minimize.
[2024-05-23 11:43:12] [INFO ] Deduced a trap composed of 89 places in 373 ms of which 5 ms to minimize.
[2024-05-23 11:43:13] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 5 ms to minimize.
[2024-05-23 11:43:13] [INFO ] Deduced a trap composed of 101 places in 400 ms of which 5 ms to minimize.
[2024-05-23 11:43:14] [INFO ] Deduced a trap composed of 115 places in 396 ms of which 6 ms to minimize.
[2024-05-23 11:43:14] [INFO ] Deduced a trap composed of 89 places in 408 ms of which 5 ms to minimize.
[2024-05-23 11:43:14] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 5 ms to minimize.
[2024-05-23 11:43:15] [INFO ] Deduced a trap composed of 79 places in 404 ms of which 5 ms to minimize.
[2024-05-23 11:43:15] [INFO ] Deduced a trap composed of 117 places in 400 ms of which 5 ms to minimize.
[2024-05-23 11:43:16] [INFO ] Deduced a trap composed of 98 places in 343 ms of which 4 ms to minimize.
[2024-05-23 11:43:16] [INFO ] Deduced a trap composed of 105 places in 451 ms of which 6 ms to minimize.
[2024-05-23 11:43:17] [INFO ] Deduced a trap composed of 89 places in 373 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/892 variables, and 43 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/892 variables, and 43 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/583 constraints, Known Traps: 20/20 constraints]
After SMT, in 60933ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63644 ms. Remains : 298/298 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 322744 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 322744 steps, saw 247591 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-23 11:43:52] [INFO ] Invariant cache hit.
[2024-05-23 11:43:52] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 594/892 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/892 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 892/892 variables, and 432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 594/892 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/892 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/892 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 892/892 variables, and 434 constraints, problems are : Problem set: 0 solved, 2 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1393ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 298/298 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 286002 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 286002 steps, saw 219874 distinct states, run finished after 3003 ms. (steps per millisecond=95 ) properties seen :0
[2024-05-23 11:43:56] [INFO ] Invariant cache hit.
[2024-05-23 11:43:56] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 594/892 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/892 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 892/892 variables, and 432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 265/266 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/276 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/297 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/298 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 594/892 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/892 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/892 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 892/892 variables, and 434 constraints, problems are : Problem set: 0 solved, 2 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1344ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 126 ms.
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 20 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 298/298 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 298 /298 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-23 11:43:58] [INFO ] Invariant cache hit.
[2024-05-23 11:43:59] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-23 11:43:59] [INFO ] Invariant cache hit.
[2024-05-23 11:43:59] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 11:44:01] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2766 ms to find 0 implicit places.
[2024-05-23 11:44:01] [INFO ] Redundant transitions in 7 ms returned []
Running 583 sub problems to find dead transitions.
[2024-05-23 11:44:01] [INFO ] Invariant cache hit.
[2024-05-23 11:44:01] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-05-23 11:44:23] [INFO ] Deduced a trap composed of 116 places in 398 ms of which 6 ms to minimize.
[2024-05-23 11:44:23] [INFO ] Deduced a trap composed of 85 places in 398 ms of which 5 ms to minimize.
[2024-05-23 11:44:24] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 5 ms to minimize.
[2024-05-23 11:44:24] [INFO ] Deduced a trap composed of 113 places in 377 ms of which 5 ms to minimize.
[2024-05-23 11:44:24] [INFO ] Deduced a trap composed of 99 places in 372 ms of which 5 ms to minimize.
[2024-05-23 11:44:25] [INFO ] Deduced a trap composed of 102 places in 371 ms of which 5 ms to minimize.
[2024-05-23 11:44:25] [INFO ] Deduced a trap composed of 102 places in 408 ms of which 5 ms to minimize.
[2024-05-23 11:44:26] [INFO ] Deduced a trap composed of 105 places in 402 ms of which 5 ms to minimize.
[2024-05-23 11:44:26] [INFO ] Deduced a trap composed of 83 places in 396 ms of which 5 ms to minimize.
[2024-05-23 11:44:26] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 5 ms to minimize.
[2024-05-23 11:44:27] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 5 ms to minimize.
[2024-05-23 11:44:27] [INFO ] Deduced a trap composed of 101 places in 409 ms of which 6 ms to minimize.
[2024-05-23 11:44:28] [INFO ] Deduced a trap composed of 115 places in 331 ms of which 5 ms to minimize.
[2024-05-23 11:44:28] [INFO ] Deduced a trap composed of 89 places in 438 ms of which 5 ms to minimize.
[2024-05-23 11:44:28] [INFO ] Deduced a trap composed of 82 places in 360 ms of which 5 ms to minimize.
[2024-05-23 11:44:29] [INFO ] Deduced a trap composed of 79 places in 412 ms of which 5 ms to minimize.
[2024-05-23 11:44:29] [INFO ] Deduced a trap composed of 117 places in 408 ms of which 5 ms to minimize.
[2024-05-23 11:44:30] [INFO ] Deduced a trap composed of 98 places in 412 ms of which 5 ms to minimize.
[2024-05-23 11:44:30] [INFO ] Deduced a trap composed of 105 places in 416 ms of which 5 ms to minimize.
[2024-05-23 11:44:31] [INFO ] Deduced a trap composed of 89 places in 415 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/892 variables, and 43 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/297 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/892 variables, and 43 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/583 constraints, Known Traps: 20/20 constraints]
After SMT, in 60694ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63554 ms. Remains : 298/298 places, 594/594 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 473
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 473
Applied a total of 242 rules in 14 ms. Remains 177 /298 variables (removed 121) and now considering 473/594 (removed 121) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 473 rows 177 cols
[2024-05-23 11:45:01] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 11:45:02] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 11:45:02] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2024-05-23 11:45:02] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 11:45:02] [INFO ] After 313ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-23 11:45:02] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 486 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for Anderson-PT-11-UpperBounds-07 in 144436 ms.
[2024-05-23 11:45:02] [INFO ] Flatten gal took : 205 ms
[2024-05-23 11:45:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-23 11:45:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 299 places, 596 transitions and 2380 arcs took 16 ms.
Total runtime 264853 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-11
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 299
TRANSITIONS: 596
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.006s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1060
MODEL NAME: /home/mcc/execution/416/model
299 places, 596 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="Anderson-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Anderson-PT-11, 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 r003-smll-171620117600373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 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 ;