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.r293-tall-167873945300325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945300325
=====================================================================

--------------------
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 1678827326874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-14 20:55:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 20:55:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:55:28] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-14 20:55:28] [INFO ] Transformed 170 places.
[2023-03-14 20:55:28] [INFO ] Transformed 2310 transitions.
[2023-03-14 20:55:28] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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-14 20:55:28] [INFO ] Computed 39 place invariants in 84 ms
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 246 ms. (steps per millisecond=40 ) 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 97 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :21
Incomplete Best-First random walk after 10001 steps, including 95 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 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 99 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 90 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :22
[2023-03-14 20:55:29] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 20:55:29] [INFO ] Computed 39 place invariants in 43 ms
[2023-03-14 20:55:29] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-14 20:55:29] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 12 ms returned sat
[2023-03-14 20:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:29] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-14 20:55:30] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2023-03-14 20:55:30] [INFO ] [Real]Added 1030 Read/Feed constraints in 211 ms returned sat
[2023-03-14 20:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:55:31] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:31] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-14 20:55:31] [INFO ] [Nat]Added 1030 Read/Feed constraints in 180 ms returned sat
[2023-03-14 20:55:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 293 ms.
[2023-03-14 20:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 444 ms. Result :sat
Minimization took 501 ms.
[2023-03-14 20:55:32] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:32] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:32] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-14 20:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:33] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2023-03-14 20:55:33] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-14 20:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:33] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-14 20:55:33] [INFO ] [Nat]Added 1030 Read/Feed constraints in 258 ms returned sat
[2023-03-14 20:55:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 188 ms.
[2023-03-14 20:55:33] [INFO ] Added : 0 causal constraints over 0 iterations in 324 ms. Result :sat
Minimization took 816 ms.
[2023-03-14 20:55:34] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:34] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:35] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-14 20:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:35] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:35] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-14 20:55:35] [INFO ] [Nat]Added 1030 Read/Feed constraints in 290 ms returned sat
[2023-03-14 20:55:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 174 ms.
[2023-03-14 20:55:36] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 445 ms.
[2023-03-14 20:55:36] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:36] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:36] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-14 20:55:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:37] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:37] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-14 20:55:37] [INFO ] [Nat]Added 1030 Read/Feed constraints in 232 ms returned sat
[2023-03-14 20:55:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 171 ms.
[2023-03-14 20:55:37] [INFO ] Added : 0 causal constraints over 0 iterations in 299 ms. Result :sat
Minimization took 336 ms.
[2023-03-14 20:55:38] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:55:38] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:38] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2023-03-14 20:55:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:38] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:38] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:39] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-14 20:55:39] [INFO ] [Nat]Added 1030 Read/Feed constraints in 267 ms returned sat
[2023-03-14 20:55:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 206 ms.
[2023-03-14 20:55:39] [INFO ] Added : 0 causal constraints over 0 iterations in 345 ms. Result :sat
Minimization took 850 ms.
[2023-03-14 20:55:40] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned sat
[2023-03-14 20:55:40] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:41] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-14 20:55:41] [INFO ] [Real]Added 1030 Read/Feed constraints in 187 ms returned sat
[2023-03-14 20:55:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:41] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:41] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-14 20:55:41] [INFO ] [Nat]Added 1030 Read/Feed constraints in 181 ms returned sat
[2023-03-14 20:55:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 210 ms.
[2023-03-14 20:55:42] [INFO ] Added : 0 causal constraints over 0 iterations in 341 ms. Result :sat
Minimization took 482 ms.
[2023-03-14 20:55:42] [INFO ] [Real]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:42] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 20:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:43] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-14 20:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:55:43] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2023-03-14 20:55:43] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 20:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:55:43] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2023-03-14 20:55:43] [INFO ] [Nat]Added 1030 Read/Feed constraints in 210 ms returned sat
[2023-03-14 20:55:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 209 ms.
[2023-03-14 20:55:44] [INFO ] Added : 0 causal constraints over 0 iterations in 340 ms. Result :sat
Minimization took 328 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 255 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 20:55:47] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2023-03-14 20:55:47] [INFO ] Invariant cache hit.
[2023-03-14 20:55:48] [INFO ] Dead Transitions using invariants and state equation in 764 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 110 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 1133 ms. Remains : 170/170 places, 1885/2265 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:55:48] [INFO ] Computed 39 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 119456 resets, run finished after 15718 ms. (steps per millisecond=63 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9045 resets, run finished after 3152 ms. (steps per millisecond=317 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9829 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9580 resets, run finished after 1891 ms. (steps per millisecond=528 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 7076 resets, run finished after 1559 ms. (steps per millisecond=641 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 1000001 steps, including 9804 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9044 resets, run finished after 3204 ms. (steps per millisecond=312 ) properties (out of 7) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9998 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 7) seen :22
[2023-03-14 20:56:19] [INFO ] Invariant cache hit.
[2023-03-14 20:56:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:19] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-14 20:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:20] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-14 20:56:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:56:22] [INFO ] [Real]Added 1010 Read/Feed constraints in 2238 ms returned sat
[2023-03-14 20:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:22] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:22] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-14 20:56:25] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2868 ms returned sat
[2023-03-14 20:56:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 181 ms.
[2023-03-14 20:56:25] [INFO ] Added : 0 causal constraints over 0 iterations in 304 ms. Result :sat
Minimization took 3002 ms.
[2023-03-14 20:56:28] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:29] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-14 20:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:29] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-14 20:56:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 20:56:29] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:29] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-14 20:56:31] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1862 ms returned sat
[2023-03-14 20:56:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 178 ms.
[2023-03-14 20:56:31] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 3003 ms.
[2023-03-14 20:56:34] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:56:34] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:35] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-14 20:56:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:56:38] [INFO ] [Real]Added 1010 Read/Feed constraints in 3104 ms returned sat
[2023-03-14 20:56:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:38] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 15 ms returned sat
[2023-03-14 20:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:38] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-14 20:56:40] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1292 ms returned sat
[2023-03-14 20:56:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 176 ms.
[2023-03-14 20:56:40] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 3001 ms.
[2023-03-14 20:56:43] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 20:56:43] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:43] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-14 20:56:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 20:56:43] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:44] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2023-03-14 20:56:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1412 ms returned sat
[2023-03-14 20:56:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 177 ms.
[2023-03-14 20:56:45] [INFO ] Added : 0 causal constraints over 0 iterations in 300 ms. Result :sat
Minimization took 3001 ms.
[2023-03-14 20:56:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:49] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-14 20:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:49] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-14 20:56:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:49] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:49] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-14 20:56:51] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1835 ms returned sat
[2023-03-14 20:56:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 180 ms.
[2023-03-14 20:56:51] [INFO ] Added : 0 causal constraints over 0 iterations in 301 ms. Result :sat
Minimization took 3001 ms.
[2023-03-14 20:56:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:54] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:55] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-14 20:56:57] [INFO ] [Real]Added 1010 Read/Feed constraints in 2244 ms returned sat
[2023-03-14 20:56:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:56:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:56:57] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:56:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:56:57] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-14 20:57:00] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2961 ms returned sat
[2023-03-14 20:57:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 179 ms.
[2023-03-14 20:57:01] [INFO ] Added : 0 causal constraints over 0 iterations in 306 ms. Result :sat
Minimization took 3002 ms.
[2023-03-14 20:57:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:57:04] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:04] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-14 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:57:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:57:04] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:05] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-03-14 20:57:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:57:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6093 ms returned unknown
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 112 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 112 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 108 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 20:57:11] [INFO ] Invariant cache hit.
[2023-03-14 20:57:11] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-14 20:57:11] [INFO ] Invariant cache hit.
[2023-03-14 20:57:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:13] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-03-14 20:57:13] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-14 20:57:13] [INFO ] Invariant cache hit.
[2023-03-14 20:57:14] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2911 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
[2023-03-14 20:57:14] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1184 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :4
[2023-03-14 20:57:14] [INFO ] Invariant cache hit.
[2023-03-14 20:57:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:57:14] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:14] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-14 20:57:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:16] [INFO ] [Real]Added 1010 Read/Feed constraints in 2041 ms returned sat
[2023-03-14 20:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:57:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:57:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:17] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-14 20:57:20] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2977 ms returned sat
[2023-03-14 20:57:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 169 ms.
[2023-03-14 20:57:20] [INFO ] Added : 0 causal constraints over 0 iterations in 290 ms. Result :sat
Minimization took 1355 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 232 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:57:22] [INFO ] Computed 39 place invariants in 46 ms
[2023-03-14 20:57:22] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 878 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:57:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119386 resets, run finished after 12591 ms. (steps per millisecond=79 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9404 resets, run finished after 2909 ms. (steps per millisecond=343 ) properties (out of 1) seen :4
[2023-03-14 20:57:38] [INFO ] Invariant cache hit.
[2023-03-14 20:57:38] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-14 20:57:38] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-14 20:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:38] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-14 20:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:57:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:57:38] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:57:38] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-14 20:57:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:57:45] [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 112 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 112 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 101 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:57:45] [INFO ] Invariant cache hit.
[2023-03-14 20:57:45] [INFO ] Implicit Places using invariants in 227 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 232 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-14 20:57:45] [INFO ] Computed 29 place invariants in 25 ms
[2023-03-14 20:57:45] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-14 20:57:45] [INFO ] Invariant cache hit.
[2023-03-14 20:57:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:57:48] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2468 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 2998 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:57:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178937 resets, run finished after 16715 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 2932 ms. (steps per millisecond=341 ) properties (out of 1) seen :4
[2023-03-14 20:58:07] [INFO ] Invariant cache hit.
[2023-03-14 20:58:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 20:58:07] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-14 20:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:08] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-14 20:58:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:58:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 20:58:08] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-14 20:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:08] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-14 20:58:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:58:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1425 ms returned sat
[2023-03-14 20:58:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 152 ms.
[2023-03-14 20:58:10] [INFO ] Added : 0 causal constraints over 0 iterations in 263 ms. Result :sat
Minimization took 3002 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 104 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 104 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-14 20:58:13] [INFO ] Invariant cache hit.
[2023-03-14 20:58:13] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-14 20:58:13] [INFO ] Invariant cache hit.
[2023-03-14 20:58:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:58:15] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 2502 ms to find 0 implicit places.
[2023-03-14 20:58:16] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-14 20:58:16] [INFO ] Invariant cache hit.
[2023-03-14 20:58:16] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3253 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00 in 62479 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:58:16] [INFO ] Computed 39 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-14 20:58:16] [INFO ] Invariant cache hit.
[2023-03-14 20:58:16] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:58:16] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-14 20:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:17] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-14 20:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:58:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:58:17] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:17] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2023-03-14 20:58:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:58:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1738 ms returned sat
[2023-03-14 20:58:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 161 ms.
[2023-03-14 20:58:19] [INFO ] Added : 0 causal constraints over 0 iterations in 286 ms. Result :sat
Minimization took 2568 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 230 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:58:22] [INFO ] Computed 39 place invariants in 36 ms
[2023-03-14 20:58:23] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:58:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119279 resets, run finished after 11166 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10366 resets, run finished after 1475 ms. (steps per millisecond=677 ) properties (out of 1) seen :2
[2023-03-14 20:58:35] [INFO ] Invariant cache hit.
[2023-03-14 20:58:35] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:58:35] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:36] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-14 20:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:58:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:58:36] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:58:36] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-14 20:58:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:58:38] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1907 ms returned sat
[2023-03-14 20:58:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 166 ms.
[2023-03-14 20:58:38] [INFO ] Added : 0 causal constraints over 0 iterations in 280 ms. Result :sat
Minimization took 2509 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-14 20:58:41] [INFO ] Invariant cache hit.
[2023-03-14 20:58:41] [INFO ] Implicit Places using invariants in 353 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 357 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 201 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 20:58:42] [INFO ] Computed 29 place invariants in 24 ms
[2023-03-14 20:58:42] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-14 20:58:42] [INFO ] Invariant cache hit.
[2023-03-14 20:58:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:58:48] [INFO ] Implicit Places using invariants and state equation in 6036 ms returned []
Implicit Place search using SMT with State Equation took 6413 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 7066 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 20:58:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178928 resets, run finished after 15402 ms. (steps per millisecond=64 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 14084 resets, run finished after 1408 ms. (steps per millisecond=710 ) properties (out of 1) seen :2
[2023-03-14 20:59:05] [INFO ] Invariant cache hit.
[2023-03-14 20:59:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:59:05] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-14 20:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:05] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-14 20:59:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:59:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 20:59:05] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-14 20:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:06] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-14 20:59:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:59:08] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2470 ms returned sat
[2023-03-14 20:59:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 157 ms.
[2023-03-14 20:59:08] [INFO ] Added : 0 causal constraints over 0 iterations in 266 ms. Result :sat
Minimization took 3009 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 96 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 20:59:12] [INFO ] Invariant cache hit.
[2023-03-14 20:59:12] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-14 20:59:12] [INFO ] Invariant cache hit.
[2023-03-14 20:59:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:59:18] [INFO ] Implicit Places using invariants and state equation in 6050 ms returned []
Implicit Place search using SMT with State Equation took 6396 ms to find 0 implicit places.
[2023-03-14 20:59:18] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-14 20:59:18] [INFO ] Invariant cache hit.
[2023-03-14 20:59:19] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7116 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-01 in 62447 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 20:59:19] [INFO ] Computed 39 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 1186 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :4
[2023-03-14 20:59:19] [INFO ] Invariant cache hit.
[2023-03-14 20:59:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 20:59:19] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 20:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:19] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-14 20:59:19] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:59:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:59:23] [INFO ] [Real]Added 1010 Read/Feed constraints in 3364 ms returned sat
[2023-03-14 20:59:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:59:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 20:59:23] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 20:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:23] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-14 20:59:24] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1389 ms returned sat
[2023-03-14 20:59:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 187 ms.
[2023-03-14 20:59:25] [INFO ] Added : 0 causal constraints over 0 iterations in 325 ms. Result :sat
Minimization took 2867 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 215 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 20:59:28] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 20:59:29] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 20:59:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119375 resets, run finished after 11231 ms. (steps per millisecond=89 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9732 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 1) seen :4
[2023-03-14 20:59:41] [INFO ] Invariant cache hit.
[2023-03-14 20:59:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:59:41] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:42] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-14 20:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 20:59:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 20:59:42] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-14 20:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 20:59:42] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-14 20:59:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 20:59:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 20:59:48] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6093 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 104 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 104 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 96 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 20:59:48] [INFO ] Invariant cache hit.
[2023-03-14 20:59:49] [INFO ] Implicit Places using invariants in 365 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 370 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 94 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 560 ms. Remains : 150/160 places, 1875/1875 transitions.
// Phase 1: matrix 1875 rows 150 cols
[2023-03-14 20:59:49] [INFO ] Computed 29 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 119168 resets, run finished after 10794 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 9735 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties (out of 1) seen :4
[2023-03-14 21:00:01] [INFO ] Invariant cache hit.
[2023-03-14 21:00:01] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:01] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-14 21:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:01] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-14 21:00:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:00:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:02] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 10 ms returned sat
[2023-03-14 21:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:02] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-14 21:00:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 21:00:08] [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 101 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 101 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 96 ms. Remains 150 /150 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 21:00:08] [INFO ] Invariant cache hit.
[2023-03-14 21:00:08] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-14 21:00:08] [INFO ] Invariant cache hit.
[2023-03-14 21:00:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:15] [INFO ] Implicit Places using invariants and state equation in 6432 ms returned []
Implicit Place search using SMT with State Equation took 6751 ms to find 0 implicit places.
[2023-03-14 21:00:15] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-14 21:00:15] [INFO ] Invariant cache hit.
[2023-03-14 21:00:16] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7452 ms. Remains : 150/150 places, 1875/1875 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-02 in 56909 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 21:00:16] [INFO ] Computed 39 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 1197 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 71 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :4
[2023-03-14 21:00:16] [INFO ] Invariant cache hit.
[2023-03-14 21:00:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:16] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:16] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-03-14 21:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:00:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:16] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-14 21:00:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1399 ms returned sat
[2023-03-14 21:00:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 162 ms.
[2023-03-14 21:00:18] [INFO ] Added : 0 causal constraints over 0 iterations in 288 ms. Result :sat
Minimization took 2964 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 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 21:00:21] [INFO ] Invariant cache hit.
[2023-03-14 21:00:22] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 667 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-14 21:00:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119213 resets, run finished after 10811 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7076 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 1) seen :4
[2023-03-14 21:00:34] [INFO ] Invariant cache hit.
[2023-03-14 21:00:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:34] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 21:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:34] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-14 21:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:00:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:34] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:34] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-14 21:00:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1422 ms returned sat
[2023-03-14 21:00:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 156 ms.
[2023-03-14 21:00:36] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 3013 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 96 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 96 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 95 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 21:00:39] [INFO ] Invariant cache hit.
[2023-03-14 21:00:40] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-14 21:00:40] [INFO ] Invariant cache hit.
[2023-03-14 21:00:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:47] [INFO ] Implicit Places using invariants and state equation in 6831 ms returned []
Implicit Place search using SMT with State Equation took 7178 ms to find 0 implicit places.
[2023-03-14 21:00:47] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-14 21:00:47] [INFO ] Invariant cache hit.
[2023-03-14 21:00:47] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7924 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-03 in 31719 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05
[2023-03-14 21:00:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-14 21:00:47] [INFO ] Invariant cache hit.
[2023-03-14 21:00:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-14 21:00:47] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 21:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:48] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-14 21:00:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:00:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:00:48] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:00:48] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-14 21:00:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:00:50] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1849 ms returned sat
[2023-03-14 21:00:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 168 ms.
[2023-03-14 21:00:50] [INFO ] Added : 0 causal constraints over 0 iterations in 291 ms. Result :sat
Minimization took 2442 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 214 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 21:00:53] [INFO ] Computed 39 place invariants in 39 ms
[2023-03-14 21:00:54] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 21:00:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119356 resets, run finished after 10977 ms. (steps per millisecond=91 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 10365 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 1) seen :2
[2023-03-14 21:01:06] [INFO ] Invariant cache hit.
[2023-03-14 21:01:06] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 21:01:06] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-14 21:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:06] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-14 21:01:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:01:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 21:01:07] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-14 21:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:07] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-14 21:01:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:01:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1972 ms returned sat
[2023-03-14 21:01:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1830 transitions) in 147 ms.
[2023-03-14 21:01:09] [INFO ] Added : 0 causal constraints over 0 iterations in 259 ms. Result :sat
Minimization took 2642 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 95 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 95 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 111 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 21:01:12] [INFO ] Invariant cache hit.
[2023-03-14 21:01:12] [INFO ] Implicit Places using invariants in 359 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 361 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 192 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 21:01:13] [INFO ] Computed 29 place invariants in 35 ms
[2023-03-14 21:01:13] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-14 21:01:13] [INFO ] Invariant cache hit.
[2023-03-14 21:01:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:01:19] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned []
Implicit Place search using SMT with State Equation took 6445 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 7110 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 21:01:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 178921 resets, run finished after 15296 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 1406 ms. (steps per millisecond=711 ) properties (out of 1) seen :2
[2023-03-14 21:01:36] [INFO ] Invariant cache hit.
[2023-03-14 21:01:36] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 21:01:36] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-14 21:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:36] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-14 21:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:01:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 21:01:36] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 9 ms returned sat
[2023-03-14 21:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:36] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-14 21:01:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:01:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2449 ms returned sat
[2023-03-14 21:01:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 158 ms.
[2023-03-14 21:01:39] [INFO ] Added : 0 causal constraints over 0 iterations in 273 ms. Result :sat
Minimization took 3007 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 116 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 116 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-14 21:01:42] [INFO ] Invariant cache hit.
[2023-03-14 21:01:43] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-14 21:01:43] [INFO ] Invariant cache hit.
[2023-03-14 21:01:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:01:49] [INFO ] Implicit Places using invariants and state equation in 6050 ms returned []
Implicit Place search using SMT with State Equation took 6401 ms to find 0 implicit places.
[2023-03-14 21:01:49] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 21:01:49] [INFO ] Invariant cache hit.
[2023-03-14 21:01:50] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7130 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-05 in 62293 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 21:01:50] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :4
[2023-03-14 21:01:50] [INFO ] Invariant cache hit.
[2023-03-14 21:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:01:50] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:50] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-14 21:01:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:01:52] [INFO ] [Real]Added 1010 Read/Feed constraints in 2100 ms returned sat
[2023-03-14 21:01:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:01:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-14 21:01:52] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 21:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:01:53] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2023-03-14 21:01:55] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2838 ms returned sat
[2023-03-14 21:01:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 156 ms.
[2023-03-14 21:01:56] [INFO ] Added : 0 causal constraints over 0 iterations in 274 ms. Result :sat
Minimization took 1509 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 195 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 21:01:57] [INFO ] Computed 39 place invariants in 35 ms
[2023-03-14 21:01:58] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 160/170 places, 1875/1885 transitions.
[2023-03-14 21:01:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119313 resets, run finished after 12552 ms. (steps per millisecond=79 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 9408 resets, run finished after 2897 ms. (steps per millisecond=345 ) properties (out of 1) seen :4
[2023-03-14 21:02:13] [INFO ] Invariant cache hit.
[2023-03-14 21:02:14] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 21:02:14] [INFO ] [Real]Absence check using 14 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-14 21:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:14] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-14 21:02:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:02:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-14 21:02:14] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-14 21:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:14] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-14 21:02:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:02:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 21:02:20] [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 112 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 112 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 91 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 21:02:21] [INFO ] Invariant cache hit.
[2023-03-14 21:02:21] [INFO ] Implicit Places using invariants in 206 ms returned [2, 37, 56, 72, 89, 95, 105, 109, 137, 156]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 211 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 184 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 21:02:21] [INFO ] Computed 29 place invariants in 22 ms
[2023-03-14 21:02:21] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-14 21:02:21] [INFO ] Invariant cache hit.
[2023-03-14 21:02:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:02:23] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 2404 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 2891 ms. Remains : 140/160 places, 1865/1875 transitions.
[2023-03-14 21:02:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 179025 resets, run finished after 16741 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 2942 ms. (steps per millisecond=339 ) properties (out of 1) seen :4
[2023-03-14 21:02:43] [INFO ] Invariant cache hit.
[2023-03-14 21:02:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 21:02:43] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-14 21:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:43] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-14 21:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:02:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 21:02:43] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-14 21:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:44] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-14 21:02:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:02:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1425 ms returned sat
[2023-03-14 21:02:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1820 transitions) in 148 ms.
[2023-03-14 21:02:45] [INFO ] Added : 0 causal constraints over 0 iterations in 269 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 97 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 89 ms. Remains 140 /140 variables (removed 0) and now considering 1865/1865 (removed 0) transitions.
[2023-03-14 21:02:49] [INFO ] Invariant cache hit.
[2023-03-14 21:02:49] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-14 21:02:49] [INFO ] Invariant cache hit.
[2023-03-14 21:02:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:02:51] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2023-03-14 21:02:51] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-14 21:02:51] [INFO ] Invariant cache hit.
[2023-03-14 21:02:52] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3124 ms. Remains : 140/140 places, 1865/1865 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-06 in 62132 ms.
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 21:02:52] [INFO ] Computed 39 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 1191 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
[2023-03-14 21:02:52] [INFO ] Invariant cache hit.
[2023-03-14 21:02:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:02:52] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-14 21:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:52] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-03-14 21:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:02:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:02:52] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-14 21:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:02:53] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-14 21:02:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:02:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 21:02:57] [INFO ] [Nat]Added 1010 Read/Feed constraints in 4639 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 99 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 21:02:57] [INFO ] Invariant cache hit.
[2023-03-14 21:02:58] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 170/170 places, 1885/1885 transitions.
[2023-03-14 21:02:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 119363 resets, run finished after 10934 ms. (steps per millisecond=91 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 9998 resets, run finished after 1478 ms. (steps per millisecond=676 ) properties (out of 1) seen :2
[2023-03-14 21:03:10] [INFO ] Invariant cache hit.
[2023-03-14 21:03:10] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:03:10] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 21:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 21:03:11] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-14 21:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 21:03:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-14 21:03:11] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-14 21:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 21:03:11] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-14 21:03:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:03:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 21:03:17] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6100 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 100 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 93 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 21:03:17] [INFO ] Invariant cache hit.
[2023-03-14 21:03:18] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-14 21:03:18] [INFO ] Invariant cache hit.
[2023-03-14 21:03:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 21:03:25] [INFO ] Implicit Places using invariants and state equation in 6797 ms returned []
Implicit Place search using SMT with State Equation took 7131 ms to find 0 implicit places.
[2023-03-14 21:03:25] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-14 21:03:25] [INFO ] Invariant cache hit.
[2023-03-14 21:03:25] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7847 ms. Remains : 170/170 places, 1885/1885 transitions.
Ending property specific reduction for PhilosophersDyn-PT-10-UpperBounds-07 in 33474 ms.
[2023-03-14 21:03:26] [INFO ] Flatten gal took : 224 ms
[2023-03-14 21:03:26] [INFO ] Applying decomposition
[2023-03-14 21:03:26] [INFO ] Flatten gal took : 132 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13353755869024242945.txt' '-o' '/tmp/graph13353755869024242945.bin' '-w' '/tmp/graph13353755869024242945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13353755869024242945.bin' '-l' '-1' '-v' '-w' '/tmp/graph13353755869024242945.weights' '-q' '0' '-e' '0.001'
[2023-03-14 21:03:26] [INFO ] Decomposing Gal with order
[2023-03-14 21:03:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 21:03:27] [INFO ] Removed a total of 3364 redundant transitions.
[2023-03-14 21:03:27] [INFO ] Flatten gal took : 642 ms
[2023-03-14 21:03:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-14 21:03:27] [INFO ] Time to serialize gal into /tmp/UpperBounds17094663882971972153.gal : 22 ms
[2023-03-14 21:03:27] [INFO ] Time to serialize properties into /tmp/UpperBounds17029242474578495243.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17094663882971972153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17029242474578495243.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17029242474578495243.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,199051,147.294,2519356,2,246805,5,3.05728e+06,6,0,2588,912291,0
Total reachable state count : 199051

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-00 :0 <= gu8.Neighbourhood_7_3+gi2.gu11.Neighbourhood_2_10+gu10.Neighbourhood_9_1+gi3.gu5.Neighbourhood_3...2393
FORMULA PhilosophersDyn-PT-10-UpperBounds-00 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-00,0,147.601,2519356,1,0,7,3.05728e+06,9,1,3184,912291,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-01 :0 <= gu10.HasRight_9+gi2.gu11.HasRight_2+gi3.gu3.HasRight_3+gu9.HasRight_8+gu12.HasRight_1+gu0.HasRig...225
FORMULA PhilosophersDyn-PT-10-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-01,0,147.859,2519356,1,0,8,3.05728e+06,10,1,3532,912291,5
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-02 :0 <= gu10.Think_9+gu9.Think_8+gu12.Think_1+gi2.gu2.Think_2+gi3.gu4.Think_3+gu8.Think_7+gu7.Think_6+gu...194
FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-02,0,148.065,2519356,1,0,9,3.05728e+06,11,1,3818,912291,6
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-03 :0 <= gu8.WaitLeft_7+gu1.WaitLeft_4+gu0.WaitLeft_10+gu6.WaitLeft_5+gi2.gu2.WaitLeft_2+gi3.gu4.WaitLeft...224
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-03,0,148.344,2519356,1,0,10,3.05728e+06,12,1,4169,912291,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-05 :0 <= gu10.HasRight_9+gi2.gu11.HasRight_2+gi3.gu3.HasRight_3+gu9.HasRight_8+gu12.HasRight_1+gu0.HasRig...225
FORMULA PhilosophersDyn-PT-10-UpperBounds-05 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-05,0,148.344,2519356,1,0,10,3.05728e+06,12,1,4169,912291,7
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property PhilosophersDyn-PT-10-UpperBounds-06 :0 <= gu8.Neighbourhood_7_3+gi2.gu11.Neighbourhood_2_10+gu10.Neighbourhood_9_1+gi3.gu5.Neighbourhood_3...2393
FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-06,0,148.355,2519356,1,0,10,3.05728e+06,12,1,4169,912291,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-PT-10-UpperBounds-07 :0 <= gu7.HasLeft_6+gu12.HasLeft_1+gu9.HasLeft_8+gu10.HasLeft_9+gi3.gu4.HasLeft_3+gu0.HasLeft_10+gi2.g...214
FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PhilosophersDyn-PT-10-UpperBounds-07,0,148.588,2519356,1,0,11,3.05728e+06,13,1,4507,912291,8
Total runtime 628078 ms.

BK_STOP 1678827968667

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is 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 r293-tall-167873945300325"
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 ;