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

About the Execution of Marcie+red for PhilosophersDyn-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5745.119 858368.00 890273.00 5094.50 4 2 4 4 10 2 4 2 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/mcc2023-input.r298-tall-167873951600325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951600325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 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 PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679510288459

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:38:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 18:38:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:38:10] [INFO ] Load time of PNML (sax parser for PT used): 901 ms
[2023-03-22 18:38:10] [INFO ] Transformed 170 places.
[2023-03-22 18:38:10] [INFO ] Transformed 2310 transitions.
[2023-03-22 18:38:10] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 992 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Normalized transition count is 1905 out of 2265 initially.
// Phase 1: matrix 1905 rows 170 cols
[2023-03-22 18:38:11] [INFO ] Computed 39 place invariants in 90 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 15) seen :30
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :20
[2023-03-22 18:38:11] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-22 18:38:11] [INFO ] Computed 39 place invariants in 41 ms
[2023-03-22 18:38:11] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 18:38:11] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:12] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-22 18:38:12] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2023-03-22 18:38:12] [INFO ] [Real]Added 1030 Read/Feed constraints in 269 ms returned sat
[2023-03-22 18:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:12] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:12] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:13] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2023-03-22 18:38:13] [INFO ] [Nat]Added 1030 Read/Feed constraints in 196 ms returned sat
[2023-03-22 18:38:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 359 ms.
[2023-03-22 18:38:13] [INFO ] Added : 0 causal constraints over 0 iterations in 510 ms. Result :sat
Minimization took 489 ms.
[2023-03-22 18:38:14] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:14] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-22 18:38:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:14] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:15] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-22 18:38:15] [INFO ] [Nat]Added 1030 Read/Feed constraints in 277 ms returned sat
[2023-03-22 18:38:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 207 ms.
[2023-03-22 18:38:15] [INFO ] Added : 0 causal constraints over 0 iterations in 364 ms. Result :sat
Minimization took 839 ms.
[2023-03-22 18:38:16] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-22 18:38:16] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:17] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-22 18:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:17] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:17] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-22 18:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:17] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-22 18:38:17] [INFO ] [Nat]Added 1030 Read/Feed constraints in 302 ms returned sat
[2023-03-22 18:38:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 178 ms.
[2023-03-22 18:38:18] [INFO ] Added : 0 causal constraints over 0 iterations in 317 ms. Result :sat
Minimization took 442 ms.
[2023-03-22 18:38:18] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:18] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:19] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-22 18:38:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-22 18:38:19] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:19] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-22 18:38:19] [INFO ] [Nat]Added 1030 Read/Feed constraints in 237 ms returned sat
[2023-03-22 18:38:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 184 ms.
[2023-03-22 18:38:20] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 314 ms.
[2023-03-22 18:38:20] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:20] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:20] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-22 18:38:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:20] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-22 18:38:20] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:21] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-03-22 18:38:21] [INFO ] [Nat]Added 1030 Read/Feed constraints in 268 ms returned sat
[2023-03-22 18:38:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 185 ms.
[2023-03-22 18:38:21] [INFO ] Added : 0 causal constraints over 0 iterations in 319 ms. Result :sat
Minimization took 847 ms.
[2023-03-22 18:38:22] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-22 18:38:22] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:23] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-22 18:38:23] [INFO ] [Real]Added 1030 Read/Feed constraints in 186 ms returned sat
[2023-03-22 18:38:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:23] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:23] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-22 18:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:23] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-22 18:38:23] [INFO ] [Nat]Added 1030 Read/Feed constraints in 181 ms returned sat
[2023-03-22 18:38:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 181 ms.
[2023-03-22 18:38:24] [INFO ] Added : 0 causal constraints over 0 iterations in 309 ms. Result :sat
Minimization took 474 ms.
[2023-03-22 18:38:24] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:24] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 18:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:25] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-22 18:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:38:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-22 18:38:25] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-22 18:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:25] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-22 18:38:25] [INFO ] [Nat]Added 1030 Read/Feed constraints in 193 ms returned sat
[2023-03-22 18:38:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 226 ms.
[2023-03-22 18:38:26] [INFO ] Added : 0 causal constraints over 0 iterations in 371 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, -1, 10] Max seen :[4, 2, 4, 4, 2, 4, 2]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 245 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-22 18:38:29] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2023-03-22 18:38:29] [INFO ] Invariant cache hit.
[2023-03-22 18:38:30] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1115 ms. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:38:30] [INFO ] Computed 39 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 119374 resets, run finished after 15048 ms. (steps per millisecond=66 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000000 steps, including 9041 resets, run finished after 2886 ms. (steps per millisecond=346 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9809 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000000 steps, including 9572 resets, run finished after 1845 ms. (steps per millisecond=542 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 7087 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 1000001 steps, including 9814 resets, run finished after 1814 ms. (steps per millisecond=551 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000000 steps, including 9041 resets, run finished after 2877 ms. (steps per millisecond=347 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9984 resets, run finished after 1825 ms. (steps per millisecond=547 ) properties (out of 7) seen :22
[2023-03-22 18:38:59] [INFO ] Invariant cache hit.
[2023-03-22 18:38:59] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:38:59] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:00] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2023-03-22 18:39:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:39:02] [INFO ] [Real]Added 1010 Read/Feed constraints in 2221 ms returned sat
[2023-03-22 18:39:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:02] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:02] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-22 18:39:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2899 ms returned sat
[2023-03-22 18:39:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 174 ms.
[2023-03-22 18:39:06] [INFO ] Added : 0 causal constraints over 0 iterations in 292 ms. Result :sat
Minimization took 3001 ms.
[2023-03-22 18:39:09] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:09] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:09] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-22 18:39:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:09] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:09] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-22 18:39:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1840 ms returned sat
[2023-03-22 18:39:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 169 ms.
[2023-03-22 18:39:12] [INFO ] Added : 0 causal constraints over 0 iterations in 298 ms. Result :sat
Minimization took 3001 ms.
[2023-03-22 18:39:15] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:15] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:15] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-22 18:39:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:39:18] [INFO ] [Real]Added 1010 Read/Feed constraints in 3271 ms returned sat
[2023-03-22 18:39:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:18] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-22 18:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:19] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-22 18:39:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1311 ms returned sat
[2023-03-22 18:39:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2023-03-22 18:39:20] [INFO ] Added : 0 causal constraints over 0 iterations in 281 ms. Result :sat
Minimization took 3001 ms.
[2023-03-22 18:39:23] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:23] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:24] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-22 18:39:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:39:24] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:24] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-22 18:39:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1364 ms returned sat
[2023-03-22 18:39:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 158 ms.
[2023-03-22 18:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 277 ms. Result :sat
Minimization took 3002 ms.
[2023-03-22 18:39:29] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:39:29] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:29] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2023-03-22 18:39:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:39:29] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:29] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-22 18:39:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1797 ms returned sat
[2023-03-22 18:39:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2023-03-22 18:39:32] [INFO ] Added : 0 causal constraints over 0 iterations in 282 ms. Result :sat
Minimization took 3001 ms.
[2023-03-22 18:39:35] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:35] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-22 18:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:35] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-22 18:39:37] [INFO ] [Real]Added 1010 Read/Feed constraints in 2160 ms returned sat
[2023-03-22 18:39:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:37] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:38] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-03-22 18:39:40] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2856 ms returned sat
[2023-03-22 18:39:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 166 ms.
[2023-03-22 18:39:41] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 3014 ms.
[2023-03-22 18:39:44] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-22 18:39:44] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:44] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-22 18:39:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:44] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:45] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2023-03-22 18:39:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:39:50] [INFO ] [Nat]Added 1010 Read/Feed constraints in 5702 ms returned sat
[2023-03-22 18:39:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 162 ms.
[2023-03-22 18:39:51] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1, 10, 10, 10, 10, -1, 10] Max seen :[4, 2, 4, 4, 2, 4, 2]
Support contains 140 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 111 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 96 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 18:39:54] [INFO ] Invariant cache hit.
[2023-03-22 18:39:54] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-22 18:39:54] [INFO ] Invariant cache hit.
[2023-03-22 18:39:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:39:56] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-22 18:39:56] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-22 18:39:56] [INFO ] Invariant cache hit.
[2023-03-22 18:39:57] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
[2023-03-22 18:39:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :4
[2023-03-22 18:39:57] [INFO ] Invariant cache hit.
[2023-03-22 18:39:57] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:39:57] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-22 18:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:57] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-22 18:39:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:39:59] [INFO ] [Real]Added 1010 Read/Feed constraints in 2151 ms returned sat
[2023-03-22 18:39:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:39:59] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:00] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-22 18:40:03] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2905 ms returned sat
[2023-03-22 18:40:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2023-03-22 18:40:03] [INFO ] Added : 0 causal constraints over 0 iterations in 292 ms. Result :sat
Minimization took 1425 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 223 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 18:40:05] [INFO ] Computed 39 place invariants in 43 ms
[2023-03-22 18:40:05] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-22 18:40:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119318 resets, run finished after 12469 ms. (steps per millisecond=80 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9405 resets, run finished after 2644 ms. (steps per millisecond=378 ) properties (out of 1) seen :4
[2023-03-22 18:40:20] [INFO ] Invariant cache hit.
[2023-03-22 18:40:20] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-22 18:40:20] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-22 18:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:21] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-22 18:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:40:21] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:21] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-22 18:40:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:40:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:40:27] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6081 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 117 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 95 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:40:27] [INFO ] Invariant cache hit.
[2023-03-22 18:40:28] [INFO ] Implicit Places using invariants in 226 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 244 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 206 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 18:40:28] [INFO ] Computed 29 place invariants in 28 ms
[2023-03-22 18:40:28] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-22 18:40:28] [INFO ] Invariant cache hit.
[2023-03-22 18:40:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:40:30] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2448 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2995 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-22 18:40:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178921 resets, run finished after 16511 ms. (steps per millisecond=60 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2633 ms. (steps per millisecond=379 ) properties (out of 1) seen :4
[2023-03-22 18:40:49] [INFO ] Invariant cache hit.
[2023-03-22 18:40:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 18:40:49] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 18:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:50] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-22 18:40:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 18:40:50] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 18:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:50] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-22 18:40:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:40:52] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1407 ms returned sat
[2023-03-22 18:40:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 141 ms.
[2023-03-22 18:40:52] [INFO ] Added : 0 causal constraints over 0 iterations in 248 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 108 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 92 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-22 18:40:55] [INFO ] Invariant cache hit.
[2023-03-22 18:40:55] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-22 18:40:55] [INFO ] Invariant cache hit.
[2023-03-22 18:40:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:40:57] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2023-03-22 18:40:58] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-22 18:40:58] [INFO ] Invariant cache hit.
[2023-03-22 18:40:58] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3164 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 61533 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:40:58] [INFO ] Computed 39 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 1211 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :2
[2023-03-22 18:40:58] [INFO ] Invariant cache hit.
[2023-03-22 18:40:58] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:40:58] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-22 18:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:59] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-03-22 18:40:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:40:59] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:59] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-22 18:40:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:41:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1759 ms returned sat
[2023-03-22 18:41:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 147 ms.
[2023-03-22 18:41:01] [INFO ] Added : 0 causal constraints over 0 iterations in 271 ms. Result :sat
Minimization took 2579 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 218 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 18:41:04] [INFO ] Computed 39 place invariants in 36 ms
[2023-03-22 18:41:05] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-22 18:41:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119355 resets, run finished after 10788 ms. (steps per millisecond=92 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10346 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties (out of 1) seen :2
[2023-03-22 18:41:17] [INFO ] Invariant cache hit.
[2023-03-22 18:41:17] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:41:17] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-22 18:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:17] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2023-03-22 18:41:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:41:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 18:41:17] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-22 18:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:17] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-22 18:41:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:41:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1859 ms returned sat
[2023-03-22 18:41:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 150 ms.
[2023-03-22 18:41:20] [INFO ] Added : 0 causal constraints over 0 iterations in 266 ms. Result :sat
Minimization took 2445 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:41:22] [INFO ] Invariant cache hit.
[2023-03-22 18:41:23] [INFO ] Implicit Places using invariants in 342 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 348 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 190 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 18:41:23] [INFO ] Computed 29 place invariants in 26 ms
[2023-03-22 18:41:23] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-22 18:41:23] [INFO ] Invariant cache hit.
[2023-03-22 18:41:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:41:29] [INFO ] Implicit Places using invariants and state equation in 6002 ms returned []
Implicit Place search using SMT with State Equation took 6366 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6998 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-22 18:41:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178951 resets, run finished after 15126 ms. (steps per millisecond=66 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties (out of 1) seen :2
[2023-03-22 18:41:46] [INFO ] Invariant cache hit.
[2023-03-22 18:41:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 18:41:46] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-22 18:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:46] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-22 18:41:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:41:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 18:41:46] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-22 18:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:47] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-22 18:41:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:41:49] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2374 ms returned sat
[2023-03-22 18:41:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 164 ms.
[2023-03-22 18:41:49] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 3006 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 101 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 92 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-22 18:41:52] [INFO ] Invariant cache hit.
[2023-03-22 18:41:53] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-22 18:41:53] [INFO ] Invariant cache hit.
[2023-03-22 18:41:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:41:59] [INFO ] Implicit Places using invariants and state equation in 6020 ms returned []
Implicit Place search using SMT with State Equation took 6366 ms to find 0 implicit places.
[2023-03-22 18:41:59] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 18:41:59] [INFO ] Invariant cache hit.
[2023-03-22 18:41:59] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7113 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 61419 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:42:00] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1180 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :4
[2023-03-22 18:42:00] [INFO ] Invariant cache hit.
[2023-03-22 18:42:00] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:42:00] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:00] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-22 18:42:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:42:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:42:03] [INFO ] [Real]Added 1010 Read/Feed constraints in 3145 ms returned sat
[2023-03-22 18:42:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:42:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:03] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:04] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-22 18:42:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1249 ms returned sat
[2023-03-22 18:42:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2023-03-22 18:42:05] [INFO ] Added : 0 causal constraints over 0 iterations in 266 ms. Result :sat
Minimization took 3006 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 208 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 18:42:08] [INFO ] Computed 39 place invariants in 32 ms
[2023-03-22 18:42:09] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-22 18:42:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119373 resets, run finished after 10918 ms. (steps per millisecond=91 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9738 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 1) seen :4
[2023-03-22 18:42:21] [INFO ] Invariant cache hit.
[2023-03-22 18:42:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:22] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:22] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-22 18:42:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:42:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:22] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:22] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-22 18:42:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:42:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:42:28] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6080 ms returned unknown
Current structural bounds on expressions (after SMT) : [1294] Max seen :[4]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 101 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:42:29] [INFO ] Invariant cache hit.
[2023-03-22 18:42:29] [INFO ] Implicit Places using invariants in 374 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 378 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 102 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 574 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2023-03-22 18:42:29] [INFO ] Computed 29 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 119185 resets, run finished after 10881 ms. (steps per millisecond=91 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9740 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 1) seen :4
[2023-03-22 18:42:41] [INFO ] Invariant cache hit.
[2023-03-22 18:42:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:41] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 18:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:42] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-22 18:42:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:42:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:42] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 18:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:42] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-22 18:42:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:42:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:42:48] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6083 ms returned unknown
Current structural bounds on expressions (after SMT) : [411] Max seen :[4]
Support contains 10 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 98 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 150/150 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1875/1875 transitions.
Applied a total of 0 rules in 94 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:42:48] [INFO ] Invariant cache hit.
[2023-03-22 18:42:49] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 18:42:49] [INFO ] Invariant cache hit.
[2023-03-22 18:42:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:42:55] [INFO ] Implicit Places using invariants and state equation in 6453 ms returned []
Implicit Place search using SMT with State Equation took 6797 ms to find 0 implicit places.
[2023-03-22 18:42:55] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-22 18:42:55] [INFO ] Invariant cache hit.
[2023-03-22 18:42:56] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7506 ms. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 56302 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:42:56] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1175 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :4
[2023-03-22 18:42:56] [INFO ] Invariant cache hit.
[2023-03-22 18:42:56] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:42:56] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-22 18:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:56] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-22 18:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:42:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:42:56] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:42:57] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-22 18:42:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:42:58] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1376 ms returned sat
[2023-03-22 18:42:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2023-03-22 18:42:58] [INFO ] Added : 0 causal constraints over 0 iterations in 276 ms. Result :sat
Minimization took 2982 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 18:43:01] [INFO ] Invariant cache hit.
[2023-03-22 18:43:02] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-22 18:43:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119438 resets, run finished after 10966 ms. (steps per millisecond=91 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7075 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 1) seen :4
[2023-03-22 18:43:14] [INFO ] Invariant cache hit.
[2023-03-22 18:43:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:43:14] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-22 18:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:15] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-22 18:43:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:43:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:43:15] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-22 18:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:15] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2023-03-22 18:43:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:43:16] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1410 ms returned sat
[2023-03-22 18:43:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 163 ms.
[2023-03-22 18:43:17] [INFO ] Added : 0 causal constraints over 0 iterations in 288 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 98 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 94 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 18:43:20] [INFO ] Invariant cache hit.
[2023-03-22 18:43:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-22 18:43:20] [INFO ] Invariant cache hit.
[2023-03-22 18:43:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:43:27] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned []
Implicit Place search using SMT with State Equation took 7216 ms to find 0 implicit places.
[2023-03-22 18:43:27] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 18:43:27] [INFO ] Invariant cache hit.
[2023-03-22 18:43:28] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7982 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 32033 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
[2023-03-22 18:43:28] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1208 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-22 18:43:28] [INFO ] Invariant cache hit.
[2023-03-22 18:43:28] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:43:28] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-22 18:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:28] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-22 18:43:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:43:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:43:28] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-22 18:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:29] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-22 18:43:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:43:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1833 ms returned sat
[2023-03-22 18:43:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 156 ms.
[2023-03-22 18:43:31] [INFO ] Added : 0 causal constraints over 0 iterations in 272 ms. Result :sat
Minimization took 2468 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 204 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 18:43:34] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-22 18:43:34] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-22 18:43:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119321 resets, run finished after 11098 ms. (steps per millisecond=90 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10352 resets, run finished after 1452 ms. (steps per millisecond=688 ) properties (out of 1) seen :2
[2023-03-22 18:43:47] [INFO ] Invariant cache hit.
[2023-03-22 18:43:47] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:43:47] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:47] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-22 18:43:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:43:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:43:47] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:43:48] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-22 18:43:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:43:50] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1938 ms returned sat
[2023-03-22 18:43:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 155 ms.
[2023-03-22 18:43:50] [INFO ] Added : 0 causal constraints over 0 iterations in 264 ms. Result :sat
Minimization took 2536 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 93 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:43:53] [INFO ] Invariant cache hit.
[2023-03-22 18:43:53] [INFO ] Implicit Places using invariants in 375 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 378 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 189 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 18:43:53] [INFO ] Computed 29 place invariants in 25 ms
[2023-03-22 18:43:54] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-22 18:43:54] [INFO ] Invariant cache hit.
[2023-03-22 18:43:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:44:00] [INFO ] Implicit Places using invariants and state equation in 6058 ms returned []
Implicit Place search using SMT with State Equation took 6418 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7078 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-22 18:44:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178934 resets, run finished after 15370 ms. (steps per millisecond=65 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1377 ms. (steps per millisecond=726 ) properties (out of 1) seen :2
[2023-03-22 18:44:16] [INFO ] Invariant cache hit.
[2023-03-22 18:44:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 18:44:16] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 18:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:17] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-22 18:44:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:44:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 18:44:17] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-22 18:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:17] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-22 18:44:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:44:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2452 ms returned sat
[2023-03-22 18:44:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 144 ms.
[2023-03-22 18:44:20] [INFO ] Added : 0 causal constraints over 0 iterations in 262 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [1294] Max seen :[2]
Support contains 10 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 98 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 92 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-22 18:44:23] [INFO ] Invariant cache hit.
[2023-03-22 18:44:23] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-22 18:44:23] [INFO ] Invariant cache hit.
[2023-03-22 18:44:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:44:30] [INFO ] Implicit Places using invariants and state equation in 6047 ms returned []
Implicit Place search using SMT with State Equation took 6394 ms to find 0 implicit places.
[2023-03-22 18:44:30] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-22 18:44:30] [INFO ] Invariant cache hit.
[2023-03-22 18:44:30] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7150 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 62355 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:44:30] [INFO ] Computed 39 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :4
[2023-03-22 18:44:30] [INFO ] Invariant cache hit.
[2023-03-22 18:44:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:44:30] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:31] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-22 18:44:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:44:33] [INFO ] [Real]Added 1010 Read/Feed constraints in 2158 ms returned sat
[2023-03-22 18:44:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:44:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:44:33] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:33] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-22 18:44:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2924 ms returned sat
[2023-03-22 18:44:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 157 ms.
[2023-03-22 18:44:37] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 1422 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 186 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-22 18:44:38] [INFO ] Computed 39 place invariants in 44 ms
[2023-03-22 18:44:39] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 823 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-22 18:44:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119285 resets, run finished after 12389 ms. (steps per millisecond=80 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9404 resets, run finished after 2642 ms. (steps per millisecond=378 ) properties (out of 1) seen :4
[2023-03-22 18:44:54] [INFO ] Invariant cache hit.
[2023-03-22 18:44:54] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:44:54] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:54] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-22 18:44:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:44:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 18:44:54] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-22 18:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:44:55] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-22 18:44:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:44:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:45:01] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6079 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 91 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 89 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-22 18:45:01] [INFO ] Invariant cache hit.
[2023-03-22 18:45:01] [INFO ] Implicit Places using invariants in 217 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 222 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 196 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-22 18:45:01] [INFO ] Computed 29 place invariants in 28 ms
[2023-03-22 18:45:02] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-22 18:45:02] [INFO ] Invariant cache hit.
[2023-03-22 18:45:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:45:04] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2941 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-22 18:45:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178954 resets, run finished after 16679 ms. (steps per millisecond=59 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11363 resets, run finished after 2666 ms. (steps per millisecond=375 ) properties (out of 1) seen :4
[2023-03-22 18:45:23] [INFO ] Invariant cache hit.
[2023-03-22 18:45:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 18:45:23] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-22 18:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:23] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-22 18:45:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:45:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 18:45:23] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-22 18:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:24] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-22 18:45:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:45:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1455 ms returned sat
[2023-03-22 18:45:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 159 ms.
[2023-03-22 18:45:26] [INFO ] Added : 0 causal constraints over 0 iterations in 275 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 100 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 96 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 140/140 places, 1865/1865 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1865/1865 transitions.
Applied a total of 0 rules in 91 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-22 18:45:29] [INFO ] Invariant cache hit.
[2023-03-22 18:45:29] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-22 18:45:29] [INFO ] Invariant cache hit.
[2023-03-22 18:45:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:45:31] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2023-03-22 18:45:31] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 18:45:31] [INFO ] Invariant cache hit.
[2023-03-22 18:45:32] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3191 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 61667 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 18:45:32] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-22 18:45:32] [INFO ] Invariant cache hit.
[2023-03-22 18:45:32] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:45:32] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:32] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-22 18:45:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:45:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:45:32] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:33] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-22 18:45:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:45:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:45:37] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4631 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 91 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 18:45:38] [INFO ] Invariant cache hit.
[2023-03-22 18:45:38] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 710 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-22 18:45:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119367 resets, run finished after 10896 ms. (steps per millisecond=91 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10032 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties (out of 1) seen :2
[2023-03-22 18:45:51] [INFO ] Invariant cache hit.
[2023-03-22 18:45:51] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:45:51] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 18:45:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:51] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-22 18:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:45:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:45:51] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-22 18:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:45:51] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-22 18:45:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:45:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 18:45:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 5506 ms returned sat
[2023-03-22 18:45:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 159 ms.
[2023-03-22 18:45:57] [INFO ] Added : 0 causal constraints over 0 iterations in 285 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 91 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 18:46:00] [INFO ] Invariant cache hit.
[2023-03-22 18:46:01] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-22 18:46:01] [INFO ] Invariant cache hit.
[2023-03-22 18:46:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 18:46:07] [INFO ] Implicit Places using invariants and state equation in 6826 ms returned []
Implicit Place search using SMT with State Equation took 7171 ms to find 0 implicit places.
[2023-03-22 18:46:08] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 18:46:08] [INFO ] Invariant cache hit.
[2023-03-22 18:46:08] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7935 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 36302 ms.
[2023-03-22 18:46:09] [INFO ] Flatten gal took : 248 ms
[2023-03-22 18:46:09] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 18:46:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 14 ms.
Total runtime 479272 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PhilosophersDyn_PT_10
(NrP: 170 NrTr: 1885 NrArc: 14300)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.065sec

net check time: 0m 0.001sec

init dd package: 0m 2.719sec


RS generation: 6m 7.634sec


-> reachability set: #nodes 1019266 (1.0e+06) #states 199,051 (5)



starting MCC model checker
--------------------------

checking: place_bound(p12,p24,p30,p65,p66,p71,p99,p124,p138,p159)
normalized: place_bound(p12,p24,p30,p65,p66,p71,p99,p124,p138,p159)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-01 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p4,p11,p21,p22,p41,p46,p58,p72,p86,p136)
normalized: place_bound(p4,p11,p21,p22,p41,p46,p58,p72,p86,p136)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p2,p38,p59,p77,p94,p102,p112,p116,p145,p166)
normalized: place_bound(p2,p38,p59,p77,p94,p102,p112,p116,p145,p166)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p12,p24,p30,p65,p66,p71,p99,p124,p138,p159)
normalized: place_bound(p12,p24,p30,p65,p66,p71,p99,p124,p138,p159)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p26,p39,p42,p68,p75,p96,p98,p120,p157,p165)
normalized: place_bound(p26,p39,p42,p68,p75,p96,p98,p120,p157,p165)

-> the formula is 2

FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p1,p5,p6,p7,p8,p9,p10,p14,p15,p17,p18,p20,p23,p25,p27,p28,p29,p32,p33,p34,p36,p37,p40,p44,p45,p48,p49,p50,p51,p52,p53,p54,p55,p56,p57,p60,p61,p62,p64,p67,p69,p70,p73,p74,p76,p78,p79,p80,p82,p84,p85,p88,p89,p90,p91,p92,p93,p95,p100,p101,p103,p104,p105,p110,p111,p113,p114,p117,p118,p119,p121,p122,p123,p126,p128,p129,p130,p131,p132,p133,p134,p135,p137,p139,p142,p143,p147,p148,p149,p150,p151,p154,p156,p158,p162,p163,p164,p167,p168,p169)
normalized: place_bound(p1,p5,p6,p7,p8,p9,p10,p14,p15,p17,p18,p20,p23,p25,p27,p28,p29,p32,p33,p34,p36,p37,p40,p44,p45,p48,p49,p50,p51,p52,p53,p54,p55,p56,p57,p60,p61,p62,p64,p67,p69,p70,p73,p74,p76,p78,p79,p80,p82,p84,p85,p88,p89,p90,p91,p92,p93,p95,p100,p101,p103,p104,p105,p110,p111,p113,p114,p117,p118,p119,p121,p122,p123,p126,p128,p129,p130,p131,p132,p133,p134,p135,p137,p139,p142,p143,p147,p148,p149,p150,p151,p154,p156,p158,p162,p163,p164,p167,p168,p169)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-00 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p1,p5,p6,p7,p8,p9,p10,p14,p15,p17,p18,p20,p23,p25,p27,p28,p29,p32,p33,p34,p36,p37,p40,p44,p45,p48,p49,p50,p51,p52,p53,p54,p55,p56,p57,p60,p61,p62,p64,p67,p69,p70,p73,p74,p76,p78,p79,p80,p82,p84,p85,p88,p89,p90,p91,p92,p93,p95,p100,p101,p103,p104,p105,p110,p111,p113,p114,p117,p118,p119,p121,p122,p123,p126,p128,p129,p130,p131,p132,p133,p134,p135,p137,p139,p142,p143,p147,p148,p149,p150,p151,p154,p156,p158,p162,p163,p164,p167,p168,p169)
normalized: place_bound(p1,p5,p6,p7,p8,p9,p10,p14,p15,p17,p18,p20,p23,p25,p27,p28,p29,p32,p33,p34,p36,p37,p40,p44,p45,p48,p49,p50,p51,p52,p53,p54,p55,p56,p57,p60,p61,p62,p64,p67,p69,p70,p73,p74,p76,p78,p79,p80,p82,p84,p85,p88,p89,p90,p91,p92,p93,p95,p100,p101,p103,p104,p105,p110,p111,p113,p114,p117,p118,p119,p121,p122,p123,p126,p128,p129,p130,p131,p132,p133,p134,p135,p137,p139,p142,p143,p147,p148,p149,p150,p151,p154,p156,p158,p162,p163,p164,p167,p168,p169)

-> the formula is 4

FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 3518024 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 113445384 1284595657 1398041041
used/not used/entry size/cache size: 67108793 71 16 1024MB
basic ops cache: hits/miss/sum: 139997 785408 925405
used/not used/entry size/cache size: 1089747 15687469 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 59603 1020236 1079839
used/not used/entry size/cache size: 961573 7427035 32 256MB
max state cache: hits/miss/sum: 298015 5101180 5399195
used/not used/entry size/cache size: 961573 7427035 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64425373
1 2032008
2 501151
3 122430
4 23634
5 3760
6 470
7 36
8 2
9 0
>= 10 0

Total processing time: 6m16.599sec


BK_STOP 1679511146827

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

83122 119529 169441 194899 256035 317826 380387 412940 451113 488057 497304 519834 561071 593218 610291 621570 634842 657494 664747 711686 772642 813345 823415 827496 836793 846342 875691 887238 919061 935196 963980 978445 990464 1014322 1023309
iterations count:3539082 (1877), effective:7585 (4)

initing FirstDep: 0m 0.011sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is PhilosophersDyn-PT-10, 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 r298-tall-167873951600325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;