About the Execution of ITS-Tools for Philosophers-COL-000100
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016400213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 Philosophers-COL-000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 6.7K Apr 29 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 11:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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 Philosophers-COL-000100-UpperBounds-00
FORMULA_NAME Philosophers-COL-000100-UpperBounds-01
FORMULA_NAME Philosophers-COL-000100-UpperBounds-02
FORMULA_NAME Philosophers-COL-000100-UpperBounds-03
FORMULA_NAME Philosophers-COL-000100-UpperBounds-04
FORMULA_NAME Philosophers-COL-000100-UpperBounds-05
FORMULA_NAME Philosophers-COL-000100-UpperBounds-06
FORMULA_NAME Philosophers-COL-000100-UpperBounds-07
FORMULA_NAME Philosophers-COL-000100-UpperBounds-08
FORMULA_NAME Philosophers-COL-000100-UpperBounds-09
FORMULA_NAME Philosophers-COL-000100-UpperBounds-10
FORMULA_NAME Philosophers-COL-000100-UpperBounds-11
FORMULA_NAME Philosophers-COL-000100-UpperBounds-12
FORMULA_NAME Philosophers-COL-000100-UpperBounds-13
FORMULA_NAME Philosophers-COL-000100-UpperBounds-14
FORMULA_NAME Philosophers-COL-000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652803355363
Running Version 202205111006
[2022-05-17 16:02:36] [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]
[2022-05-17 16:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:02:36] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 16:02:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:02:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 993 ms
[2022-05-17 16:02:37] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-17 16:02:37] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 13 ms.
[2022-05-17 16:02:37] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:02:37] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-000100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:02:37] [INFO ] Computed 2 place invariants in 25 ms
[2022-05-17 16:02:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 16:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-17 16:02:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 16:02:38] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:02:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:02:38] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 16:02:38] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [100, 50, 100, 100, 100, 100, 100, 100, 100]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:02:38] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 31 ms.
[2022-05-17 16:02:38] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 9) seen :586
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :95
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:02:39] [INFO ] Computed 200 place invariants in 14 ms
[2022-05-17 16:02:39] [INFO ] [Real]Absence check using 200 positive place invariants in 51 ms returned sat
[2022-05-17 16:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:39] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-05-17 16:02:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-17 16:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:39] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-05-17 16:02:39] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-17 16:02:40] [INFO ] Added : 4 causal constraints over 1 iterations in 109 ms. Result :sat
Minimization took 49 ms.
[2022-05-17 16:02:40] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2022-05-17 16:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:40] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-05-17 16:02:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2022-05-17 16:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:40] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-05-17 16:02:40] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-17 16:02:40] [INFO ] Added : 18 causal constraints over 4 iterations in 177 ms. Result :sat
Minimization took 60 ms.
[2022-05-17 16:02:40] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2022-05-17 16:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:41] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-17 16:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-17 16:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:41] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-17 16:02:41] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-17 16:02:41] [INFO ] Added : 4 causal constraints over 1 iterations in 113 ms. Result :sat
Minimization took 51 ms.
[2022-05-17 16:02:41] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2022-05-17 16:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:41] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-17 16:02:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2022-05-17 16:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:42] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-05-17 16:02:42] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-17 16:02:42] [INFO ] Added : 4 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 53 ms.
[2022-05-17 16:02:42] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-17 16:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:42] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-05-17 16:02:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-17 16:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:42] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-05-17 16:02:42] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-17 16:02:42] [INFO ] Added : 6 causal constraints over 2 iterations in 120 ms. Result :sat
Minimization took 54 ms.
[2022-05-17 16:02:43] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-17 16:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:43] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-05-17 16:02:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-17 16:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:43] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-17 16:02:43] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-17 16:02:43] [INFO ] Added : 6 causal constraints over 2 iterations in 133 ms. Result :sat
Minimization took 49 ms.
[2022-05-17 16:02:43] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-17 16:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:43] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-17 16:02:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-17 16:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:44] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-17 16:02:44] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-17 16:02:44] [INFO ] Added : 6 causal constraints over 2 iterations in 136 ms. Result :sat
Minimization took 52 ms.
[2022-05-17 16:02:44] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-17 16:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:44] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-05-17 16:02:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-17 16:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:44] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-17 16:02:44] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-17 16:02:45] [INFO ] Added : 6 causal constraints over 2 iterations in 119 ms. Result :sat
Minimization took 51 ms.
[2022-05-17 16:02:45] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-17 16:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-17 16:02:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:02:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-17 16:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:02:45] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-05-17 16:02:45] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-17 16:02:45] [INFO ] Added : 6 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [100, 50, 100, 100, 100, 100, 100, 100, 100] Max seen :[68, 17, 68, 68, 73, 73, 73, 73, 73]
FORMULA Philosophers-COL-000100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 500/500 places, 500/500 transitions.
Free-agglomeration rule (complex) applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 500 transition count 300
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 300 rules applied. Total rules applied 500 place count 300 transition count 200
Applied a total of 500 rules in 77 ms. Remains 300 /500 variables (removed 200) and now considering 200/500 (removed 300) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/500 places, 200/500 transitions.
// Phase 1: matrix 200 rows 300 cols
[2022-05-17 16:02:47] [INFO ] Computed 200 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9859 ms. (steps per millisecond=101 ) properties (out of 1) seen :41
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3601 ms. (steps per millisecond=277 ) properties (out of 1) seen :50
FORMULA Philosophers-COL-000100-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 24489 ms.
BK_STOP 1652803381079
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="Philosophers-COL-000100"
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 Philosophers-COL-000100, 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 r168-tall-165277016400213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000100.tgz
mv Philosophers-COL-000100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;