fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089267700003
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PhilosophersDyn-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
523.527 30393.00 44213.00 392.30 3 2 2 3 2 3 2 3 2 2 3 3 2 3 2 3 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267700003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267700003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K May 5 16:51 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-COL-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621176436640

Running Version 0
[2021-05-16 14:47:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 14:47:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:47:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 14:47:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 14:47:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 528 ms
[2021-05-16 14:47:20] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-16 14:47:20] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 3 ms.
[2021-05-16 14:47:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3855967975913852846.dot
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:47:20] [INFO ] Computed 3 place invariants in 6 ms
FORMULA PhilosophersDyn-COL-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 119 ms.
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:47:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 6 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 8 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 7 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 5 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 6 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:21] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 7 ms.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 19 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 4 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, -1, -1, 3, 3, -1, 3, 3, 3]
[2021-05-16 14:47:22] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 5 ms.
[2021-05-16 14:47:22] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2471723705350291256.dot
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :34
FORMULA PhilosophersDyn-COL-03-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 385 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 329 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10000 steps, including 377 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10000 steps, including 242 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 371 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :16
[2021-05-16 14:47:22] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 14:47:22] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 11 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-16 14:47:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 4 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 13 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 9 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:22] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 7 ms.
[2021-05-16 14:47:22] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 23 ms.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:23] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 11 ms.
[2021-05-16 14:47:23] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 8 ms.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive place invariants in 41 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 6 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 14:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-16 14:47:23] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 14 ms.
[2021-05-16 14:47:23] [INFO ] Added : 5 causal constraints over 1 iterations in 105 ms. Result :sat
Minimization took 14 ms.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:23] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 9 ms.
[2021-05-16 14:47:23] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-16 14:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:23] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 4 ms.
[2021-05-16 14:47:23] [INFO ] Added : 5 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 14:47:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-16 14:47:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:23] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 5 ms.
[2021-05-16 14:47:23] [INFO ] Added : 6 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 2147483647, 2147483647, 2147483647, 3] Max seen :[2, 2, 2, 2, 2, 2, 2, 2]
Incomplete Parikh walk after 5500 steps, including 926 resets, run finished after 11 ms. (steps per millisecond=500 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 573 resets, run finished after 5 ms. (steps per millisecond=540 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 576 resets, run finished after 5 ms. (steps per millisecond=540 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 2700 steps, including 576 resets, run finished after 6 ms. (steps per millisecond=450 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 5500 steps, including 929 resets, run finished after 10 ms. (steps per millisecond=550 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 411 resets, run finished after 5 ms. (steps per millisecond=480 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 5500 steps, including 943 resets, run finished after 10 ms. (steps per millisecond=550 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 409 resets, run finished after 5 ms. (steps per millisecond=480 ) properties (out of 8) seen :16 could not realise parikh vector
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 32 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 14:47:23] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 14:47:23] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned [3, 6, 7, 9, 11, 12, 13, 16, 19, 20, 21, 23, 25, 26, 29, 30, 33, 34, 36, 38, 39, 40, 43, 46, 47, 48, 50, 52, 53, 56]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[56, 53, 52, 50, 48, 47, 46, 43, 40, 39, 38, 36, 34, 33, 30, 29, 26, 25, 23, 21, 20, 19, 16, 13, 12, 11, 9, 7, 6, 3]
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:24] [INFO ] Computed 11 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 143062 resets, run finished after 1238 ms. (steps per millisecond=807 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000000 steps, including 38280 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 34904 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 38116 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 34767 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 23600 resets, run finished after 411 ms. (steps per millisecond=2433 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 23663 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 23706 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 34745 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 8) seen :16
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-16 14:47:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
[2021-05-16 14:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-16 14:47:28] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 9 ms.
[2021-05-16 14:47:28] [INFO ] Added : 7 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 13 ms.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:28] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2021-05-16 14:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-16 14:47:28] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:28] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:28] [INFO ] Deduced a trap composed of 7 places in 8 ms of which 1 ms to minimize.
[2021-05-16 14:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-16 14:47:28] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 6 ms.
[2021-05-16 14:47:28] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 7 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 9 ms of which 1 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 8 ms of which 1 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 2147483647, 2147483647, 2147483647, 3] Max seen :[2, 2, 2, 2, 2, 2, 2, 2]
Incomplete Parikh walk after 4900 steps, including 632 resets, run finished after 10 ms. (steps per millisecond=490 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 3300 steps, including 405 resets, run finished after 5 ms. (steps per millisecond=660 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 3300 steps, including 406 resets, run finished after 5 ms. (steps per millisecond=660 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 3300 steps, including 397 resets, run finished after 5 ms. (steps per millisecond=660 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 643 resets, run finished after 7 ms. (steps per millisecond=700 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 629 resets, run finished after 7 ms. (steps per millisecond=700 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 646 resets, run finished after 7 ms. (steps per millisecond=700 ) properties (out of 8) seen :16 could not realise parikh vector
Incomplete Parikh walk after 4900 steps, including 634 resets, run finished after 6 ms. (steps per millisecond=816 ) properties (out of 8) seen :16 could not realise parikh vector
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:29] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-16 14:47:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-01
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 384 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:29] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2021-05-16 14:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-16 14:47:29] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:29] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 630 resets, run finished after 5 ms. (steps per millisecond=980 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143347 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 38472 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 12 ms
[2021-05-16 14:47:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:30] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 11 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-16 14:47:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2021-05-16 14:47:31] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2021-05-16 14:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-16 14:47:31] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:31] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 635 resets, run finished after 5 ms. (steps per millisecond=980 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:31] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:31] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-05-16 14:47:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-01 in 1681 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-02
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:31] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 52 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-16 14:47:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:31] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:31] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 1 ms to minimize.
[2021-05-16 14:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-16 14:47:31] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 14:47:31] [INFO ] Added : 7 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 624 resets, run finished after 9 ms. (steps per millisecond=544 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 6 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 48/51 transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:31] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 146621 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 45373 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :2
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:32] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-16 14:47:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:32] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:32] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 16 ms.
[2021-05-16 14:47:32] [INFO ] Added : 4 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 6000 steps, including 907 resets, run finished after 5 ms. (steps per millisecond=1200 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:32] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:32] [INFO ] Implicit Places using invariants in 49 ms returned [18, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
[2021-05-16 14:47:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 24 cols
[2021-05-16 14:47:32] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 11 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:33] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:33] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:33] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/27 places, 45/48 transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:33] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 203680 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 255 ms. (steps per millisecond=3921 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 1 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-16 14:47:34] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:34] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3200 steps, including 609 resets, run finished after 6 ms. (steps per millisecond=533 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:34] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:34] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-16 14:47:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:34] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-02 in 2876 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-04
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:34] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 382 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 10 ms returned sat
[2021-05-16 14:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:34] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2021-05-16 14:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-16 14:47:34] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:34] [INFO ] Added : 7 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 648 resets, run finished after 4 ms. (steps per millisecond=1225 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:34] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:34] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:34] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143193 resets, run finished after 799 ms. (steps per millisecond=1251 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 38238 resets, run finished after 325 ms. (steps per millisecond=3076 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:35] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:35] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:35] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:36] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:36] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2021-05-16 14:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 14:47:36] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:36] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 633 resets, run finished after 8 ms. (steps per millisecond=612 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:36] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:36] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-16 14:47:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-04 in 1926 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-06
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 346 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:36] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 14:47:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:36] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:36] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:36] [INFO ] Deduced a trap composed of 7 places in 10 ms of which 0 ms to minimize.
[2021-05-16 14:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-16 14:47:36] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:36] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 629 resets, run finished after 4 ms. (steps per millisecond=1225 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 3 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 48/51 transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:36] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 146662 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 45382 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 1) seen :2
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 14:47:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-16 14:47:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:37] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:37] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 2 ms.
[2021-05-16 14:47:37] [INFO ] Added : 4 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 6000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=666 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:37] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:37] [INFO ] Implicit Places using invariants in 30 ms returned [18, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
[2021-05-16 14:47:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 24 cols
[2021-05-16 14:47:37] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:37] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:37] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:37] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:37] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/27 places, 45/48 transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:37] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 203412 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 256 ms. (steps per millisecond=3906 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:38] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:38] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:38] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2021-05-16 14:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-16 14:47:38] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:38] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3200 steps, including 606 resets, run finished after 4 ms. (steps per millisecond=800 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:38] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:38] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:38] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-16 14:47:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:38] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-06 in 2664 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-08
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:38] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:38] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2021-05-16 14:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-16 14:47:38] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:38] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 404 resets, run finished after 4 ms. (steps per millisecond=825 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:38] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:39] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:39] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 143188 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23683 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:40] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:40] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2021-05-16 14:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-16 14:47:40] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 2 ms.
[2021-05-16 14:47:40] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 402 resets, run finished after 4 ms. (steps per millisecond=825 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:40] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2021-05-16 14:47:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-08 in 1632 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-09
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:40] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:40] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2021-05-16 14:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-16 14:47:40] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:40] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 399 resets, run finished after 5 ms. (steps per millisecond=660 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:40] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143177 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23601 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-16 14:47:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:41] [INFO ] [Nat]Added 30 Read/Feed constraints in 15 ms returned sat
[2021-05-16 14:47:41] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2021-05-16 14:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 14:47:41] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:41] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 397 resets, run finished after 3 ms. (steps per millisecond=1100 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:41] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:41] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-16 14:47:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-09 in 1549 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-12
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:41] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 233 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:42] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:42] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 14:47:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:42] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-16 14:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-16 14:47:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:42] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:42] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2021-05-16 14:47:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 14:47:42] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:42] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 395 resets, run finished after 6 ms. (steps per millisecond=550 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:42] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 143299 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 23599 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 14:47:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-16 14:47:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:43] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:43] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2021-05-16 14:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-16 14:47:43] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2021-05-16 14:47:43] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 3300 steps, including 401 resets, run finished after 3 ms. (steps per millisecond=1100 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:43] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-16 14:47:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-16 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-12 in 1583 ms.
Starting property specific reduction for PhilosophersDyn-COL-03-UpperBounds-14
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 339 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:43] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:43] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 0 ms to minimize.
[2021-05-16 14:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-16 14:47:43] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 3 ms.
[2021-05-16 14:47:43] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 4900 steps, including 649 resets, run finished after 8 ms. (steps per millisecond=612 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 48
Applied a total of 6 rules in 3 ms. Remains 27 /30 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 48/51 transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:43] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 146453 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 45460 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :2
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:44] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-16 14:47:44] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:44] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:44] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 2 ms.
[2021-05-16 14:47:44] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 6000 steps, including 896 resets, run finished after 7 ms. (steps per millisecond=857 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 27 cols
[2021-05-16 14:47:44] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:44] [INFO ] Implicit Places using invariants in 22 ms returned [18, 19, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
[2021-05-16 14:47:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 24 cols
[2021-05-16 14:47:44] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:44] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:45] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:45] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 21/27 places, 45/48 transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:45] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 203554 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 66666 resets, run finished after 251 ms. (steps per millisecond=3984 ) properties (out of 1) seen :2
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:46] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:46] [INFO ] [Real]Absence check using 2 positive and 6 generalized place invariants in 0 ms returned sat
[2021-05-16 14:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:46] [INFO ] [Nat]Absence check using 2 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-16 14:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-16 14:47:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:46] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2021-05-16 14:47:46] [INFO ] Deduced a trap composed of 7 places in 7 ms of which 0 ms to minimize.
[2021-05-16 14:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-16 14:47:46] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 2 ms.
[2021-05-16 14:47:46] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 3200 steps, including 631 resets, run finished after 5 ms. (steps per millisecond=640 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:46] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:46] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 14:47:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-16 14:47:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 21 cols
[2021-05-16 14:47:46] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 45/45 transitions.
Ending property specific reduction for PhilosophersDyn-COL-03-UpperBounds-14 in 2692 ms.
[2021-05-16 14:47:46] [INFO ] Flatten gal took : 27 ms
[2021-05-16 14:47:46] [INFO ] Applying decomposition
[2021-05-16 14:47:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph671217182452420493.txt, -o, /tmp/graph671217182452420493.bin, -w, /tmp/graph671217182452420493.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph671217182452420493.bin, -l, -1, -v, -w, /tmp/graph671217182452420493.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 14:47:46] [INFO ] Decomposing Gal with order
[2021-05-16 14:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:47:46] [INFO ] Removed a total of 107 redundant transitions.
[2021-05-16 14:47:46] [INFO ] Flatten gal took : 30 ms
[2021-05-16 14:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 14:47:46] [INFO ] Time to serialize gal into /tmp/UpperBounds10088380763618925446.gal : 7 ms
[2021-05-16 14:47:46] [INFO ] Time to serialize properties into /tmp/UpperBounds11318094196830459012.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10088380763618925446.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11318094196830459012.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10088380763618925446.gal -t CGAL -reachable-file /tmp/UpperBounds11318094196830459012.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11318094196830459012.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,325,0.198187,4392,2,509,5,2173,6,0,180,1989,0
Total reachable state count : 325

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-01 :0 <= gi2.gu4.HasLeft_0+gi0.gu6.HasLeft_1+gi1.gu7.HasLeft_2 <= 2
FORMULA PhilosophersDyn-COL-03-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-COL-03-UpperBounds-01,0,0.198829,4392,1,0,7,2173,9,1,271,1989,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-02 :0 <= gi2.gu8.HasRight_0+gi0.gu5.HasRight_1+gi1.gu9.HasRight_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-02 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-COL-03-UpperBounds-02,0,0.199438,4392,1,0,8,2173,10,1,332,1989,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-04 :0 <= gi2.gu4.HasLeft_0+gi0.gu6.HasLeft_1+gi1.gu7.HasLeft_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-04 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-COL-03-UpperBounds-04,0,0.199519,4392,1,0,8,2173,10,1,332,1989,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-06 :0 <= gi2.gu8.HasRight_0+gi0.gu5.HasRight_1+gi1.gu9.HasRight_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-06 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-COL-03-UpperBounds-06,0,0.199601,4392,1,0,8,2173,10,1,332,1989,5
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-08 :0 <= gi2.gu4.Forks_0+gi0.gu6.Forks_1+gi1.gu7.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-08 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-COL-03-UpperBounds-08,0,0.200054,4392,1,0,9,2173,11,1,377,1989,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-09 :0 <= gi2.gu4.Forks_0+gi0.gu6.Forks_1+gi1.gu7.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-09 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-COL-03-UpperBounds-09,0,0.200125,4392,1,0,9,2173,11,1,377,1989,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-12 :0 <= gi2.gu4.Forks_0+gi0.gu6.Forks_1+gi1.gu7.Forks_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-12 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-COL-03-UpperBounds-12,0,0.200192,4392,1,0,9,2173,11,1,377,1989,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PhilosophersDyn-COL-03-UpperBounds-14 :0 <= gi2.gu8.HasRight_0+gi0.gu5.HasRight_1+gi1.gu9.HasRight_2 <= 2
FORMULA PhilosophersDyn-COL-03-UpperBounds-14 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-COL-03-UpperBounds-14,0,0.200272,4392,1,0,9,2173,11,1,377,1989,6
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621176467033

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-COL-03"
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-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-03, 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 r159-oct2-162089267700003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 ;