MCC'2021- Execution of r140-tall-162298996000155

About the Execution of ITS-Tools for Philosophers-PT-001000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1179.995	2023717.00	974544.00	7331.00	1000 1000 1000 1000 1000 500 1000 1000 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 Philosophers-PT-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 47M
-rw-r--r-- 1 mcc users 3.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M 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 449K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 336K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 367K Mar 27 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Mar 27 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 278K Mar 25 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 25 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 104K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 262K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.4M 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 Philosophers-PT-001000-UpperBounds-00
FORMULA_NAME Philosophers-PT-001000-UpperBounds-01
FORMULA_NAME Philosophers-PT-001000-UpperBounds-02
FORMULA_NAME Philosophers-PT-001000-UpperBounds-03
FORMULA_NAME Philosophers-PT-001000-UpperBounds-04
FORMULA_NAME Philosophers-PT-001000-UpperBounds-05
FORMULA_NAME Philosophers-PT-001000-UpperBounds-06
FORMULA_NAME Philosophers-PT-001000-UpperBounds-07
FORMULA_NAME Philosophers-PT-001000-UpperBounds-08
FORMULA_NAME Philosophers-PT-001000-UpperBounds-09
FORMULA_NAME Philosophers-PT-001000-UpperBounds-10
FORMULA_NAME Philosophers-PT-001000-UpperBounds-11
FORMULA_NAME Philosophers-PT-001000-UpperBounds-12
FORMULA_NAME Philosophers-PT-001000-UpperBounds-13
FORMULA_NAME Philosophers-PT-001000-UpperBounds-14
FORMULA_NAME Philosophers-PT-001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1622993947295

Running Version 0
[2021-06-06 15:39:09] [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-06-06 15:39:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 15:39:09] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2021-06-06 15:39:09] [INFO ] Transformed 5000 places.
[2021-06-06 15:39:09] [INFO ] Transformed 5000 transitions.
[2021-06-06 15:39:09] [INFO ] Found NUPN structural information;
[2021-06-06 15:39:09] [INFO ] Parsed PT model containing 5000 places and 5000 transitions in 345 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 125 ms.
FORMULA Philosophers-PT-001000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:39:10] [INFO ] Computed 2000 place invariants in 63 ms
FORMULA Philosophers-PT-001000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3201 ms. (steps per millisecond=3 ) properties (out of 9) seen :1778
FORMULA Philosophers-PT-001000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-001000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-001000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-001000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 5) seen :4
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:39:16] [INFO ] Computed 2000 place invariants in 38 ms
[2021-06-06 15:39:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 755 ms returned sat
[2021-06-06 15:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:39:20] [INFO ] [Real]Absence check using state equation in 2699 ms returned sat
[2021-06-06 15:39:20] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:39:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 588 ms returned sat
[2021-06-06 15:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:39:28] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2021-06-06 15:39:28] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:39:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 582 ms returned sat
[2021-06-06 15:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:39:37] [INFO ] [Real]Absence check using state equation in 2665 ms returned sat
[2021-06-06 15:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:39:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 612 ms returned sat
[2021-06-06 15:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:39:47] [INFO ] [Real]Absence check using state equation in 2875 ms returned sat
[2021-06-06 15:39:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:39:53] [INFO ] [Real]Absence check using 2000 positive place invariants in 562 ms returned sat
[2021-06-06 15:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:39:56] [INFO ] [Real]Absence check using state equation in 2887 ms returned sat
[2021-06-06 15:39:56] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[415, 415, 395, 154, 395]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 429 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:40:02] [INFO ] Computed 2000 place invariants in 21 ms
Interrupted random walk after 143546 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=715, 1=715, 2=606, 3=135, 4=606}
Interrupted Best-First random walk after 104298 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=20 ) properties seen :{0=53, 1=53}
Interrupted Best-First random walk after 89976 steps, including 0 resets, run timeout after 5028 ms. (steps per millisecond=17 ) properties seen :{0=45, 1=45}
Interrupted Best-First random walk after 90977 steps, including 0 resets, run timeout after 5042 ms. (steps per millisecond=18 ) properties seen :{2=46, 4=46}
Interrupted Best-First random walk after 93415 steps, including 0 resets, run timeout after 5048 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 2=1, 3=23, 4=1}
Interrupted Best-First random walk after 94793 steps, including 0 resets, run timeout after 5040 ms. (steps per millisecond=18 ) properties seen :{2=48, 4=48}
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:40:57] [INFO ] Computed 2000 place invariants in 18 ms
[2021-06-06 15:40:58] [INFO ] [Real]Absence check using 2000 positive place invariants in 626 ms returned sat
[2021-06-06 15:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:41:01] [INFO ] [Real]Absence check using state equation in 2754 ms returned sat
[2021-06-06 15:41:01] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:41:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 557 ms returned sat
[2021-06-06 15:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:41:50] [INFO ] [Real]Absence check using state equation in 3044 ms returned sat
[2021-06-06 15:41:51] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:42:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 547 ms returned sat
[2021-06-06 15:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:42:40] [INFO ] [Real]Absence check using state equation in 2754 ms returned sat
[2021-06-06 15:42:40] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:43:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 615 ms returned sat
[2021-06-06 15:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:43:29] [INFO ] [Real]Absence check using state equation in 3131 ms returned sat
[2021-06-06 15:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:44:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 586 ms returned sat
[2021-06-06 15:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:44:19] [INFO ] [Real]Absence check using state equation in 2896 ms returned sat
[2021-06-06 15:44:19] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[715, 715, 606, 154, 606]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 135 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 134 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:45:04] [INFO ] Computed 2000 place invariants in 10 ms
[2021-06-06 15:45:05] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:45:05] [INFO ] Computed 2000 place invariants in 12 ms
[2021-06-06 15:45:06] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2021-06-06 15:45:06] [INFO ] Redundant transitions in 365 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:45:06] [INFO ] Computed 2000 place invariants in 19 ms
[2021-06-06 15:45:07] [INFO ] Dead Transitions using invariants and state equation in 716 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:45:07] [INFO ] Computed 2000 place invariants in 14 ms
Interrupted random walk after 138572 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=525, 1=525, 2=656, 3=150, 4=656}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5035 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5034 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 94793 steps, including 0 resets, run timeout after 5046 ms. (steps per millisecond=18 ) properties seen :{2=48, 4=48}
Interrupted Best-First random walk after 94339 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=18 ) properties seen :{0=2, 1=2, 2=1, 3=23, 4=1}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:46:02] [INFO ] Computed 2000 place invariants in 14 ms
[2021-06-06 15:46:03] [INFO ] [Real]Absence check using 2000 positive place invariants in 577 ms returned sat
[2021-06-06 15:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:46:06] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2021-06-06 15:46:06] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:46:52] [INFO ] [Real]Absence check using 2000 positive place invariants in 577 ms returned sat
[2021-06-06 15:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:46:55] [INFO ] [Real]Absence check using state equation in 2672 ms returned sat
[2021-06-06 15:46:55] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:47:41] [INFO ] [Real]Absence check using 2000 positive place invariants in 577 ms returned sat
[2021-06-06 15:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:47:44] [INFO ] [Real]Absence check using state equation in 2831 ms returned sat
[2021-06-06 15:47:44] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:48:31] [INFO ] [Real]Absence check using 2000 positive place invariants in 617 ms returned sat
[2021-06-06 15:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:48:34] [INFO ] [Real]Absence check using state equation in 2838 ms returned sat
[2021-06-06 15:48:34] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:49:20] [INFO ] [Real]Absence check using 2000 positive place invariants in 580 ms returned sat
[2021-06-06 15:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:49:23] [INFO ] [Real]Absence check using state equation in 2816 ms returned sat
[2021-06-06 15:49:23] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[715, 715, 656, 154, 656]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 133 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 121 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:50:08] [INFO ] Computed 2000 place invariants in 8 ms
[2021-06-06 15:50:09] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:50:09] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 15:50:10] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2021-06-06 15:50:10] [INFO ] Redundant transitions in 242 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:50:10] [INFO ] Computed 2000 place invariants in 12 ms
[2021-06-06 15:50:11] [INFO ] Dead Transitions using invariants and state equation in 764 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:50:11] [INFO ] Computed 2000 place invariants in 7 ms
Interrupted random walk after 142416 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=570, 1=570, 2=659, 3=141, 4=659}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5019 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5016 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 95697 steps, including 0 resets, run timeout after 5047 ms. (steps per millisecond=18 ) properties seen :{2=48, 4=48}
Interrupted Best-First random walk after 94344 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 2=1, 3=23, 4=1}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5023 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:51:06] [INFO ] Computed 2000 place invariants in 16 ms
[2021-06-06 15:51:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 564 ms returned sat
[2021-06-06 15:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:51:10] [INFO ] [Real]Absence check using state equation in 2664 ms returned sat
[2021-06-06 15:51:10] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:51:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 587 ms returned sat
[2021-06-06 15:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:51:59] [INFO ] [Real]Absence check using state equation in 2859 ms returned sat
[2021-06-06 15:51:59] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:52:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 574 ms returned sat
[2021-06-06 15:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:52:49] [INFO ] [Real]Absence check using state equation in 2775 ms returned sat
[2021-06-06 15:52:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:53:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 615 ms returned sat
[2021-06-06 15:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:53:38] [INFO ] [Real]Absence check using state equation in 2912 ms returned sat
[2021-06-06 15:53:38] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:54:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 602 ms returned sat
[2021-06-06 15:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:54:27] [INFO ] [Real]Absence check using state equation in 2908 ms returned sat
[2021-06-06 15:54:28] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[715, 715, 659, 154, 659]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 114 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 114 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:55:13] [INFO ] Computed 2000 place invariants in 8 ms
[2021-06-06 15:55:14] [INFO ] Implicit Places using invariants in 713 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:55:14] [INFO ] Computed 2000 place invariants in 13 ms
[2021-06-06 15:55:14] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2021-06-06 15:55:15] [INFO ] Redundant transitions in 310 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:55:15] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 15:55:15] [INFO ] Dead Transitions using invariants and state equation in 713 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:55:15] [INFO ] Computed 2000 place invariants in 15 ms
Interrupted random walk after 146264 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=627, 1=627, 2=535, 3=159, 4=535}
Interrupted Best-First random walk after 90977 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=18 ) properties seen :{0=46, 1=46}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
Interrupted Best-First random walk after 94344 steps, including 0 resets, run timeout after 5048 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 2=1, 3=23, 4=1}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:56:11] [INFO ] Computed 2000 place invariants in 22 ms
[2021-06-06 15:56:12] [INFO ] [Real]Absence check using 2000 positive place invariants in 603 ms returned sat
[2021-06-06 15:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:56:15] [INFO ] [Real]Absence check using state equation in 2890 ms returned sat
[2021-06-06 15:56:15] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:57:01] [INFO ] [Real]Absence check using 2000 positive place invariants in 559 ms returned sat
[2021-06-06 15:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:57:04] [INFO ] [Real]Absence check using state equation in 2707 ms returned sat
[2021-06-06 15:57:04] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:57:50] [INFO ] [Real]Absence check using 2000 positive place invariants in 572 ms returned sat
[2021-06-06 15:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:57:53] [INFO ] [Real]Absence check using state equation in 3033 ms returned sat
[2021-06-06 15:57:54] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 15:58:40] [INFO ] [Real]Absence check using 2000 positive place invariants in 608 ms returned sat
[2021-06-06 15:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:58:43] [INFO ] [Real]Absence check using state equation in 2890 ms returned sat
[2021-06-06 15:58:43] [INFO ] Computed and/alt/rep : 3000/4000/3000 causal constraints (skipped 0 transitions) in 261 ms.
[2021-06-06 15:58:53] [INFO ] Added : 173 causal constraints over 35 iterations in 9780 ms. Result :sat
[2021-06-06 15:58:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 576 ms returned sat
[2021-06-06 15:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 15:58:57] [INFO ] [Real]Absence check using state equation in 2816 ms returned sat
[2021-06-06 15:58:58] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[715, 715, 659, 159, 659]
Incomplete Parikh walk after 70000 steps, including 98 resets, run finished after 16474 ms. (steps per millisecond=4 ) properties (out of 5) seen :1081 could not realise parikh vector
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 115 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 105 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 15:59:59] [INFO ] Computed 2000 place invariants in 8 ms
[2021-06-06 16:00:00] [INFO ] Implicit Places using invariants in 715 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:00:00] [INFO ] Computed 2000 place invariants in 12 ms
[2021-06-06 16:00:01] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2021-06-06 16:00:01] [INFO ] Redundant transitions in 312 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:00:01] [INFO ] Computed 2000 place invariants in 12 ms
[2021-06-06 16:00:02] [INFO ] Dead Transitions using invariants and state equation in 706 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:00:02] [INFO ] Computed 2000 place invariants in 11 ms
Interrupted random walk after 139429 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen :{0=658, 1=658, 2=557, 3=147, 4=557}
Interrupted Best-First random walk after 92886 steps, including 0 resets, run timeout after 5026 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5046 ms. (steps per millisecond=18 ) properties seen :{0=47, 1=47}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
Interrupted Best-First random walk after 93415 steps, including 0 resets, run timeout after 5029 ms. (steps per millisecond=18 ) properties seen :{0=1, 1=1, 2=1, 3=23, 4=1}
Interrupted Best-First random walk after 93792 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=18 ) properties seen :{2=47, 4=47}
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:00:57] [INFO ] Computed 2000 place invariants in 15 ms
[2021-06-06 16:00:58] [INFO ] [Real]Absence check using 2000 positive place invariants in 578 ms returned sat
[2021-06-06 16:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:01:01] [INFO ] [Real]Absence check using state equation in 2760 ms returned sat
[2021-06-06 16:01:01] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 16:01:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 594 ms returned sat
[2021-06-06 16:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:01:50] [INFO ] [Real]Absence check using state equation in 2744 ms returned sat
[2021-06-06 16:01:50] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 16:02:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 564 ms returned sat
[2021-06-06 16:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:02:39] [INFO ] [Real]Absence check using state equation in 2789 ms returned sat
[2021-06-06 16:02:39] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 16:03:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 607 ms returned sat
[2021-06-06 16:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:03:29] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2021-06-06 16:03:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 16:04:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 590 ms returned sat
[2021-06-06 16:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:04:18] [INFO ] [Real]Absence check using state equation in 2852 ms returned sat
[2021-06-06 16:04:18] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000] Max seen :[715, 715, 659, 193, 659]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 113 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 106 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:03] [INFO ] Computed 2000 place invariants in 8 ms
[2021-06-06 16:05:04] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:04] [INFO ] Computed 2000 place invariants in 10 ms
[2021-06-06 16:05:05] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2021-06-06 16:05:05] [INFO ] Redundant transitions in 309 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:05] [INFO ] Computed 2000 place invariants in 7 ms
[2021-06-06 16:05:06] [INFO ] Dead Transitions using invariants and state equation in 671 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5000/5000 places, 5000/5000 transitions.
Starting property specific reduction for Philosophers-PT-001000-UpperBounds-00
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:06] [INFO ] Computed 2000 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1680 ms. (steps per millisecond=5 ) properties (out of 1) seen :408
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 1) seen :2
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:08] [INFO ] Computed 2000 place invariants in 16 ms
[2021-06-06 16:05:09] [INFO ] [Real]Absence check using 2000 positive place invariants in 581 ms returned sat
[2021-06-06 16:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:05:12] [INFO ] [Real]Absence check using state equation in 2668 ms returned sat
[2021-06-06 16:05:12] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[408]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 3000 place count 4000 transition count 3000
Reduce places removed 1000 places and 0 transitions.
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 5000 place count 3000 transition count 2000
Applied a total of 5000 rules in 959 ms. Remains 3000 /5000 variables (removed 2000) and now considering 2000/5000 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/5000 places, 2000/5000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:05:18] [INFO ] Computed 2000 place invariants in 3 ms
Interrupted random walk after 175597 steps, including 69 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=1000}
FORMULA Philosophers-PT-001000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-001000-UpperBounds-00 in 42258 ms.
Starting property specific reduction for Philosophers-PT-001000-UpperBounds-02
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:48] [INFO ] Computed 2000 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=6 ) properties (out of 1) seen :396
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 1) seen :2
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:05:50] [INFO ] Computed 2000 place invariants in 13 ms
[2021-06-06 16:05:51] [INFO ] [Real]Absence check using 2000 positive place invariants in 570 ms returned sat
[2021-06-06 16:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:05:54] [INFO ] [Real]Absence check using state equation in 2728 ms returned sat
[2021-06-06 16:05:54] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[396]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 3000 place count 4000 transition count 3000
Reduce places removed 1000 places and 0 transitions.
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 5000 place count 3000 transition count 2000
Applied a total of 5000 rules in 819 ms. Remains 3000 /5000 variables (removed 2000) and now considering 2000/5000 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/5000 places, 2000/5000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:06:00] [INFO ] Computed 2000 place invariants in 3 ms
Interrupted random walk after 175655 steps, including 70 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=1000}
FORMULA Philosophers-PT-001000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-001000-UpperBounds-02 in 42261 ms.
Starting property specific reduction for Philosophers-PT-001000-UpperBounds-04
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:06:30] [INFO ] Computed 2000 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1644 ms. (steps per millisecond=6 ) properties (out of 1) seen :394
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 1) seen :2
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:06:32] [INFO ] Computed 2000 place invariants in 13 ms
[2021-06-06 16:06:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 573 ms returned sat
[2021-06-06 16:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:06:36] [INFO ] [Real]Absence check using state equation in 2789 ms returned sat
[2021-06-06 16:06:37] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[394]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 3000 place count 4000 transition count 3000
Reduce places removed 1000 places and 0 transitions.
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 5000 place count 3000 transition count 2000
Applied a total of 5000 rules in 658 ms. Remains 3000 /5000 variables (removed 2000) and now considering 2000/5000 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/5000 places, 2000/5000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:06:42] [INFO ] Computed 2000 place invariants in 4 ms
Interrupted random walk after 176945 steps, including 70 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=1000}
FORMULA Philosophers-PT-001000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-001000-UpperBounds-04 in 42105 ms.
Starting property specific reduction for Philosophers-PT-001000-UpperBounds-05
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:07:12] [INFO ] Computed 2000 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1491 ms. (steps per millisecond=6 ) properties (out of 1) seen :158
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 1) seen :1
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:07:14] [INFO ] Computed 2000 place invariants in 13 ms
[2021-06-06 16:07:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 601 ms returned sat
[2021-06-06 16:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:07:18] [INFO ] [Real]Absence check using state equation in 2749 ms returned sat
[2021-06-06 16:07:18] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[158]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Free-agglomeration rule (complex) applied 2000 times.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 5000 transition count 3000
Reduce places removed 2000 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 5000 place count 3000 transition count 2000
Applied a total of 5000 rules in 662 ms. Remains 3000 /5000 variables (removed 2000) and now considering 2000/5000 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/5000 places, 2000/5000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:07:24] [INFO ] Computed 2000 place invariants in 7 ms
Interrupted random walk after 187825 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen :{0=313}
Interrupted Best-First random walk after 102675 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=20 ) properties seen :{0=114}
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:07:59] [INFO ] Computed 2000 place invariants in 7 ms
[2021-06-06 16:08:00] [INFO ] [Real]Absence check using 2000 positive place invariants in 498 ms returned sat
[2021-06-06 16:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:08:01] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2021-06-06 16:08:01] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[313]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 70 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 59 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:08:46] [INFO ] Computed 2000 place invariants in 7 ms
[2021-06-06 16:08:48] [INFO ] Implicit Places using invariants in 1481 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:08:48] [INFO ] Computed 2000 place invariants in 3 ms
[2021-06-06 16:08:49] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
[2021-06-06 16:08:49] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:08:49] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 16:08:51] [INFO ] Dead Transitions using invariants and state equation in 1321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:08:51] [INFO ] Computed 2000 place invariants in 4 ms
Interrupted random walk after 188084 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen :{0=320}
Interrupted Best-First random walk after 92060 steps, including 0 resets, run timeout after 5036 ms. (steps per millisecond=18 ) properties seen :{0=101}
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:09:26] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 16:09:27] [INFO ] [Real]Absence check using 2000 positive place invariants in 493 ms returned sat
[2021-06-06 16:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:09:28] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2021-06-06 16:09:28] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[320]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 63 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 62 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:10:13] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 16:10:14] [INFO ] Implicit Places using invariants in 1346 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:10:14] [INFO ] Computed 2000 place invariants in 8 ms
[2021-06-06 16:10:16] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
[2021-06-06 16:10:16] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:10:16] [INFO ] Computed 2000 place invariants in 7 ms
[2021-06-06 16:10:17] [INFO ] Dead Transitions using invariants and state equation in 1263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:10:17] [INFO ] Computed 2000 place invariants in 4 ms
Interrupted random walk after 187756 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen :{0=311}
Interrupted Best-First random walk after 91193 steps, including 0 resets, run timeout after 5014 ms. (steps per millisecond=18 ) properties seen :{0=100}
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:10:52] [INFO ] Computed 2000 place invariants in 7 ms
[2021-06-06 16:10:53] [INFO ] [Real]Absence check using 2000 positive place invariants in 505 ms returned sat
[2021-06-06 16:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:10:54] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2021-06-06 16:10:54] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[320]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 73 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 60 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:11:39] [INFO ] Computed 2000 place invariants in 9 ms
[2021-06-06 16:11:41] [INFO ] Implicit Places using invariants in 1349 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:11:41] [INFO ] Computed 2000 place invariants in 3 ms
[2021-06-06 16:11:42] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2021-06-06 16:11:42] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:11:42] [INFO ] Computed 2000 place invariants in 3 ms
[2021-06-06 16:11:43] [INFO ] Dead Transitions using invariants and state equation in 1256 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Ending property specific reduction for Philosophers-PT-001000-UpperBounds-05 in 271285 ms.
Starting property specific reduction for Philosophers-PT-001000-UpperBounds-07
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:11:43] [INFO ] Computed 2000 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1688 ms. (steps per millisecond=5 ) properties (out of 1) seen :396
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 1) seen :2
// Phase 1: matrix 5000 rows 5000 cols
[2021-06-06 16:11:46] [INFO ] Computed 2000 place invariants in 16 ms
[2021-06-06 16:11:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 566 ms returned sat
[2021-06-06 16:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 16:11:50] [INFO ] [Real]Absence check using state equation in 2589 ms returned sat
[2021-06-06 16:11:50] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[396]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Free-agglomeration rule (complex) applied 1000 times.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 3000 place count 4000 transition count 3000
Reduce places removed 1000 places and 0 transitions.
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 5000 place count 3000 transition count 2000
Applied a total of 5000 rules in 717 ms. Remains 3000 /5000 variables (removed 2000) and now considering 2000/5000 (removed 3000) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/5000 places, 2000/5000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-06-06 16:11:56] [INFO ] Computed 2000 place invariants in 6 ms
Interrupted random walk after 175811 steps, including 70 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=1000}
FORMULA Philosophers-PT-001000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Philosophers-PT-001000-UpperBounds-07 in 42046 ms.
[2021-06-06 16:12:26] [INFO ] Flatten gal took : 379 ms
[2021-06-06 16:12:26] [INFO ] Applying decomposition
[2021-06-06 16:12:27] [INFO ] Flatten gal took : 229 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/graph7390299139168167537.txt, -o, /tmp/graph7390299139168167537.bin, -w, /tmp/graph7390299139168167537.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/graph7390299139168167537.bin, -l, -1, -v, -w, /tmp/graph7390299139168167537.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-06 16:12:27] [INFO ] Decomposing Gal with order
[2021-06-06 16:12:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-06 16:12:28] [INFO ] Removed a total of 991 redundant transitions.
[2021-06-06 16:12:28] [INFO ] Flatten gal took : 387 ms
[2021-06-06 16:12:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2104 labels/synchronizations in 107 ms.
[2021-06-06 16:12:29] [INFO ] Time to serialize gal into /tmp/UpperBounds15071536518583200278.gal : 59 ms
[2021-06-06 16:12:29] [INFO ] Time to serialize properties into /tmp/UpperBounds15605736141529900331.prop : 2 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/UpperBounds15071536518583200278.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15605736141529900331.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/UpperBounds15071536518583200278.gal -t CGAL -reachable-file /tmp/UpperBounds15605736141529900331.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15605736141529900331.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,1.32207e+477,20.0321,349004,2,27773,5,109457,6,0,26985,75283,0
Total reachable state count : 1.322070819480806635042229428124998147867e+477

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property Philosophers-PT-001000-UpperBounds-05 :0 <= gi37.gu613.Eat_63+gi37.gu614.Eat_62+gi37.gu561.Eat_65+gi37.gu185.Eat_64+gi37.gu615.Eat_67+gi37.gu562.Eat_66+gi37.gu186.Eat_69+gi37.gu616.Eat_68+gi37.gu617.Eat_71+gi37.gu187.Eat_70+gi37.gu618.Eat_73+gi37.gu9.Eat_72+gi52.gu619.Eat_75+gi37.gu620.Eat_74+gi52.gu621.Eat_77+gi52.gu195.Eat_76+gi52.gu193.Eat_78+gi52.gu622.Eat_79+gi52.gu192.Eat_80+gi52.gu191.Eat_81+gi52.gu623.Eat_82+gi52.gu10.Eat_83+gi52.gu194.Eat_84+gi52.gu624.Eat_85+gi52.gu145.Eat_86+gi52.gu625.Eat_87+gi52.gu11.Eat_88+gi52.gu146.Eat_89+gi52.gu626.Eat_90+gi52.gu143.Eat_91+gi52.gu143.Eat_92+gi52.gu144.Eat_93+gi1.gu6.Eat_33+gi1.gu627.Eat_32+gi1.gu628.Eat_31+gi1.gu176.Eat_30+gi1.gu629.Eat_37+gi1.gu630.Eat_36+gi1.gu172.Eat_35+gi1.gu171.Eat_34+gi1.gu182.Eat_41+gi1.gu631.Eat_40+gi1.gu632.Eat_39+gi1.gu181.Eat_38+gi38.gu633.Eat_45+gi38.gu183.Eat_44+gi1.gu7.Eat_43+gi1.gu184.Eat_42+gi38.gu634.Eat_48+gi38.gu564.Eat_49+gi38.gu635.Eat_46+gi38.gu563.Eat_47+gi38.gu178.Eat_52+gi38.gu180.Eat_53+gi38.gu177.Eat_50+gi38.gu179.Eat_51+gi38.gu636.Eat_56+gi38.gu8.Eat_57+gi38.gu637.Eat_54+gi38.gu189.Eat_55+gi37.gu638.Eat_60+gi37.gu190.Eat_61+gi38.gu188.Eat_58+gi37.gu639.Eat_59+gi0.gu640.Eat_3+gi0.gu133.Eat_2+gi0.gu134.Eat_5+gi0.gu135.Eat_4+gi0.gu0.Eat_1+gi0.gu130.Eat_11+gi0.gu515.Eat_10+gi7.gu132.Eat_13+gi7.gu131.Eat_12+gi0.gu641.Eat_7+gi0.gu642.Eat_6+gi0.gu129.Eat_9+gi0.gu1.Eat_8+gi7.gu127.Eat_18+gi7.gu2.Eat_19+gi7.gu128.Eat_20+gi7.gu643.Eat_21+gi7.gu644.Eat_14+gi7.gu645.Eat_15+gi7.gu646.Eat_16+gi7.gu647.Eat_17+gi1.gu174.Eat_26+gi1.gu5.Eat_27+gi1.gu175.Eat_28+gi1.gu648.Eat_29+gi7.gu513.Eat_22+gi7.gu173.Eat_23+gi7.gu4.Eat_24+gi7.gu3.Eat_25+gi14.gu649.Eat_398+gi14.gu650.Eat_399+gi14.gu46.Eat_400+gi14.gu265.Eat_401+gi14.gu651.Eat_402+gi14.gu47.Eat_403+gi14.gu264.Eat_404+gi14.gu652.Eat_405+gi20.gu330.Eat_406+gi20.gu329.Eat_407+gi20.gu328.Eat_408+gi20.gu582.Eat_409+gi20.gu327.Eat_410+gi20.gu331.Eat_411+gi20.gu44.Eat_412+gi20.gu45.Eat_413+gi44.gu653.Eat_383+gi44.gu654.Eat_382+gi44.gu655.Eat_385+gi44.gu50.Eat_384+gi44.gu656.Eat_387+gi44.gu270.Eat_386+gi44.gu657.Eat_389+gi44.gu581.Eat_388+gi14.gu48.Eat_391+gi14.gu268.Eat_390+gi14.gu269.Eat_393+gi14.gu658.Eat_392+gi14.gu266.Eat_395+gi14.gu267.Eat_394+gi14.gu659.Eat_397+gi14.gu49.Eat_396+gi45.gu660.Eat_368+gi45.gu661.Eat_369+gi45.gu662.Eat_366+gi45.gu663.Eat_367+gi45.gu664.Eat_372+gi45.gu39.Eat_373+gi45.gu253.Eat_370+gi45.gu252.Eat_371+gi45.gu273.Eat_376+gi44.gu665.Eat_377+gi45.gu666.Eat_374+gi45.gu42.Eat_375+gi44.gu41.Eat_380+gi44.gu272.Eat_381+gi44.gu271.Eat_378+gi44.gu40.Eat_379+gi13.gu259.Eat_353+gi13.gu258.Eat_352+gi13.gu260.Eat_351+gi13.gu43.Eat_350+gi13.gu580.Eat_357+gi13.gu667.Eat_356+gi13.gu257.Eat_355+gi13.gu579.Eat_354+gi13.gu254.Eat_361+gi13.gu668.Eat_360+gi13.gu255.Eat_359+gi13.gu256.Eat_358+gi45.gu669.Eat_365+gi45.gu670.Eat_364+gi13.gu671.Eat_363+gi13.gu672.Eat_362+gi21.gu340.Eat_466+gi21.gu341.Eat_467+gi21.gu55.Eat_468+gi21.gu342.Eat_469+gi21.gu673.Eat_462+gi21.gu337.Eat_463+gi21.gu338.Eat_464+gi21.gu339.Eat_465+gi21.gu674.Eat_474+gi21.gu675.Eat_475+gi21.gu304.Eat_476+gi21.gu303.Eat_477+gi21.gu676.Eat_470+gi21.gu677.Eat_471+gi21.gu678.Eat_472+gi21.gu54.Eat_473+gi46.gu679.Eat_451+gi46.gu350.Eat_450+gi46.gu680.Eat_453+gi46.gu573.Eat_452+gi19.gu681.Eat_447+gi19.gu682.Eat_446+gi46.gu349.Eat_449+gi46.gu683.Eat_448+gi46.gu684.Eat_459+gi46.gu335.Eat_458+gi46.gu336.Eat_461+gi46.gu56.Eat_460+gi46.gu334.Eat_455+gi46.gu59.Eat_454+gi46.gu57.Eat_457+gi46.gu58.Eat_456+gi19.gu572.Eat_436+gi19.gu325.Eat_437+gi19.gu323.Eat_434+gi19.gu685.Eat_435+gi19.gu686.Eat_432+gi19.gu571.Eat_433+gi19.gu687.Eat_430+gi19.gu324.Eat_431+gi19.gu348.Eat_444+gi19.gu51.Eat_445+gi19.gu345.Eat_442+gi19.gu347.Eat_443+gi19.gu343.Eat_440+gi19.gu346.Eat_441+gi19.gu326.Eat_438+gi19.gu344.Eat_439+gi20.gu333.Eat_421+gi20.gu688.Eat_420+gi20.gu689.Eat_419+gi20.gu583.Eat_418+gi20.gu332.Eat_417+gi20.gu690.Eat_416+gi20.gu691.Eat_415+gi20.gu53.Eat_414+gi19.gu692.Eat_429+gi19.gu693.Eat_428+gi19.gu584.Eat_427+gi20.gu320.Eat_426+gi20.gu319.Eat_425+gi20.gu322.Eat_424+gi20.gu52.Eat_423+gi20.gu321.Eat_422+gi50.gu694.Eat_535+gi50.gu312.Eat_534+gi50.gu695.Eat_537+gi50.gu393.Eat_536+gi50.gu392.Eat_539+gi50.gu391.Eat_538+gi50.gu696.Eat_541+gi50.gu77.Eat_540+gi18.gu697.Eat_527+gi18.gu697.Eat_526+gi18.gu698.Eat_529+gi18.gu313.Eat_528+gi50.gu310.Eat_531+gi50.gu310.Eat_530+gi50.gu311.Eat_533+gi50.gu699.Eat_532+gi18.gu700.Eat_518+gi18.gu701.Eat_519+gi18.gu702.Eat_520+gi18.gu76.Eat_521+gi18.gu308.Eat_522+gi18.gu703.Eat_523+gi18.gu704.Eat_524+gi18.gu309.Eat_525+gi17.gu315.Eat_510+gi17.gu705.Eat_511+gi17.gu706.Eat_512+gi17.gu318.Eat_513+gi17.gu74.Eat_514+gi17.gu75.Eat_515+gi18.gu317.Eat_516+gi18.gu707.Eat_517+gi17.gu708.Eat_505+gi17.gu316.Eat_504+gi17.gu709.Eat_503+gi17.gu62.Eat_502+gi17.gu61.Eat_509+gi17.gu60.Eat_508+gi17.gu314.Eat_507+gi17.gu710.Eat_506+gi16.gu711.Eat_497+gi16.gu302.Eat_496+gi16.gu63.Eat_495+gi16.gu297.Eat_494+gi16.gu300.Eat_501+gi16.gu299.Eat_500+gi16.gu712.Eat_499+gi16.gu301.Eat_498+gi16.gu713.Eat_488+gi16.gu714.Eat_489+gi16.gu715.Eat_486+gi16.gu716.Eat_487+gi16.gu717.Eat_492+gi16.gu718.Eat_493+gi16.gu298.Eat_490+gi16.gu298.Eat_491+gi21.gu66.Eat_480+gi21.gu574.Eat_481+gi21.gu719.Eat_478+gi21.gu307.Eat_479+gi16.gu65.Eat_484+gi16.gu305.Eat_485+gi21.gu64.Eat_482+gi21.gu306.Eat_483+gi47.gu720.Eat_603+gi47.gu87.Eat_602+gi47.gu721.Eat_605+gi47.gu722.Eat_604+gi48.gu368.Eat_599+gi48.gu382.Eat_598+gi48.gu723.Eat_601+gi48.gu369.Eat_600+gi48.gu724.Eat_595+gi48.gu384.Eat_594+gi48.gu383.Eat_597+gi48.gu383.Eat_596+gi48.gu385.Eat_591+gi48.gu725.Eat_590+gi48.gu726.Eat_593+gi48.gu727.Eat_592+gi49.gu387.Eat_586+gi48.gu85.Eat_587+gi48.gu386.Eat_588+gi48.gu86.Eat_589+gi49.gu728.Eat_582+gi49.gu729.Eat_583+gi49.gu730.Eat_584+gi49.gu388.Eat_585+gi49.gu731.Eat_578+gi49.gu732.Eat_579+gi49.gu733.Eat_580+gi49.gu84.Eat_581+gi49.gu734.Eat_574+gi49.gu376.Eat_575+gi49.gu735.Eat_576+gi49.gu735.Eat_577+gi49.gu71.Eat_573+gi49.gu377.Eat_572+gi49.gu378.Eat_571+gi49.gu72.Eat_570+gi49.gu379.Eat_569+gi49.gu73.Eat_568+gi49.gu381.Eat_567+gi49.gu380.Eat_566+gi3.gu736.Eat_565+gi3.gu737.Eat_564+gi3.gu394.Eat_563+gi3.gu738.Eat_562+gi3.gu69.Eat_561+gi3.gu739.Eat_560+gi3.gu70.Eat_559+gi3.gu395.Eat_558+gi3.gu396.Eat_556+gi3.gu397.Eat_557+gi3.gu740.Eat_554+gi3.gu67.Eat_555+gi50.gu741.Eat_552+gi3.gu742.Eat_553+gi50.gu398.Eat_550+gi50.gu68.Eat_551+gi50.gu743.Eat_548+gi50.gu390.Eat_549+gi50.gu744.Eat_546+gi50.gu389.Eat_547+gi50.gu745.Eat_544+gi50.gu575.Eat_545+gi50.gu746.Eat_542+gi50.gu747.Eat_543+gi8.gu748.Eat_129+gi53.gu566.Eat_128+gi53.gu749.Eat_127+gi53.gu157.Eat_126+gi8.gu750.Eat_133+gi8.gu155.Eat_132+gi8.gu751.Eat_131+gi8.gu565.Eat_130+gi8.gu169.Eat_137+gi8.gu170.Eat_136+gi8.gu752.Eat_135+gi8.gu17.Eat_134+gi8.gu753.Eat_141+gi8.gu167.Eat_140+gi8.gu168.Eat_139+gi8.gu754.Eat_138+gi9.gu164.Eat_144+gi9.gu163.Eat_145+gi8.gu166.Eat_142+gi9.gu165.Eat_143+gi9.gu162.Eat_148+gi9.gu19.Eat_149+gi9.gu569.Eat_146+gi9.gu18.Eat_147+gi9.gu755.Eat_152+gi9.gu223.Eat_153+gi9.gu161.Eat_150+gi9.gu222.Eat_151+gi54.gu756.Eat_156+gi54.gu570.Eat_157+gi9.gu223.Eat_154+gi54.gu224.Eat_155+gi52.gu757.Eat_95+gi52.gu758.Eat_94+gi51.gu142.Eat_97+gi52.gu759.Eat_96+gi51.gu760.Eat_99+gi51.gu12.Eat_98+gi51.gu140.Eat_101+gi51.gu761.Eat_100+gi51.gu153.Eat_103+gi51.gu141.Eat_102+gi51.gu154.Eat_105+gi51.gu152.Eat_104+gi51.gu13.Eat_107+gi51.gu151.Eat_106+gi53.gu762.Eat_109+gi53.gu150.Eat_108+gi53.gu763.Eat_110+gi53.gu14.Eat_111+gi53.gu149.Eat_112+gi53.gu764.Eat_113+gi53.gu148.Eat_114+gi53.gu147.Eat_115+gi53.gu765.Eat_116+gi53.gu567.Eat_117+gi53.gu568.Eat_118+gi53.gu160.Eat_119+gi53.gu766.Eat_120+gi53.gu159.Eat_121+gi53.gu16.Eat_122+gi53.gu158.Eat_123+gi53.gu156.Eat_124+gi53.gu15.Eat_125+gi11.gu767.Eat_197+gi11.gu245.Eat_196+gi11.gu768.Eat_195+gi11.gu242.Eat_194+gi11.gu769.Eat_193+gi11.gu243.Eat_192+gi11.gu243.Eat_191+gi11.gu244.Eat_190+gi12.gu247.Eat_205+gi12.gu770.Eat_204+gi11.gu549.Eat_203+gi11.gu771.Eat_202+gi11.gu772.Eat_201+gi11.gu246.Eat_200+gi11.gu773.Eat_199+gi11.gu22.Eat_198+gi12.gu251.Eat_212+gi12.gu774.Eat_213+gi12.gu249.Eat_210+gi12.gu250.Eat_211+gi12.gu775.Eat_208+gi12.gu776.Eat_209+gi12.gu248.Eat_206+gi12.gu551.Eat_207+gi12.gu196.Eat_220+gi12.gu198.Eat_221+gi12.gu23.Eat_218+gi12.gu777.Eat_219+gi12.gu778.Eat_216+gi12.gu779.Eat_217+gi12.gu200.Eat_214+gi12.gu199.Eat_215+gi54.gu780.Eat_163+gi54.gu21.Eat_162+gi54.gu781.Eat_165+gi54.gu228.Eat_164+gi54.gu782.Eat_159+gi54.gu225.Eat_158+gi54.gu227.Eat_161+gi54.gu226.Eat_160+gi54.gu230.Eat_171+gi54.gu783.Eat_170+gi10.gu784.Eat_173+gi54.gu785.Eat_172+gi54.gu786.Eat_167+gi54.gu787.Eat_166+gi54.gu229.Eat_169+gi54.gu20.Eat_168+gi10.gu788.Eat_178+gi10.gu234.Eat_179+gi10.gu235.Eat_180+gi10.gu789.Eat_181+gi10.gu231.Eat_174+gi10.gu232.Eat_175+gi10.gu233.Eat_176+gi10.gu790.Eat_177+gi11.gu241.Eat_186+gi11.gu791.Eat_187+gi11.gu792.Eat_188+gi11.gu240.Eat_189+gi10.gu236.Eat_182+gi10.gu239.Eat_183+gi11.gu238.Eat_184+gi11.gu237.Eat_185+gi2.gu220.Eat_264+gi2.gu793.Eat_265+gi2.gu794.Eat_262+gi2.gu30.Eat_263+gi2.gu31.Eat_268+gi2.gu553.Eat_269+gi2.gu219.Eat_266+gi2.gu552.Eat_267+gi2.gu795.Eat_256+gi2.gu796.Eat_257+gi2.gu217.Eat_254+gi2.gu29.Eat_255+gi2.gu214.Eat_260+gi2.gu213.Eat_261+gi2.gu216.Eat_258+gi2.gu215.Eat_259+gi55.gu797.Eat_281+gi55.gu281.Eat_280+gi55.gu798.Eat_279+gi55.gu799.Eat_278+gi55.gu282.Eat_285+gi55.gu284.Eat_284+gi55.gu283.Eat_283+gi55.gu28.Eat_282+gi55.gu800.Eat_273+gi55.gu221.Eat_272+gi2.gu801.Eat_271+gi2.gu218.Eat_270+gi55.gu559.Eat_277+gi55.gu802.Eat_276+gi55.gu560.Eat_275+gi55.gu27.Eat_274+gi56.gu203.Eat_230+gi56.gu803.Eat_231+gi56.gu804.Eat_232+gi56.gu805.Eat_233+gi56.gu806.Eat_234+gi56.gu24.Eat_235+gi56.gu807.Eat_236+gi56.gu550.Eat_237+gi12.gu197.Eat_222+gi12.gu808.Eat_223+gi12.gu206.Eat_224+gi12.gu205.Eat_225+gi56.gu202.Eat_226+gi56.gu201.Eat_227+gi56.gu204.Eat_228+gi56.gu25.Eat_229+gi56.gu809.Eat_247+gi56.gu810.Eat_246+gi2.gu212.Eat_249+gi56.gu26.Eat_248+gi2.gu811.Eat_251+gi2.gu812.Eat_250+gi2.gu211.Eat_253+gi2.gu813.Eat_252+gi56.gu555.Eat_239+gi56.gu207.Eat_238+gi56.gu814.Eat_241+gi56.gu210.Eat_240+gi56.gu208.Eat_243+gi56.gu554.Eat_242+gi56.gu209.Eat_245+gi56.gu815.Eat_244+gi39.gu816.Eat_332+gi39.gu817.Eat_333+gi39.gu289.Eat_330+gi39.gu38.Eat_331+gi39.gu818.Eat_328+gi39.gu290.Eat_329+gi39.gu819.Eat_326+gi39.gu288.Eat_327+gi39.gu292.Eat_324+gi39.gu293.Eat_325+gi57.gu291.Eat_322+gi57.gu820.Eat_323+gi57.gu821.Eat_320+gi57.gu822.Eat_321+gi57.gu823.Eat_318+gi57.gu37.Eat_319+gi13.gu261.Eat_349+gi13.gu824.Eat_348+gi13.gu825.Eat_347+gi39.gu36.Eat_346+gi39.gu262.Eat_345+gi39.gu263.Eat_344+gi39.gu578.Eat_343+gi39.gu826.Eat_342+gi39.gu827.Eat_341+gi39.gu287.Eat_340+gi39.gu828.Eat_339+gi39.gu286.Eat_338+gi39.gu829.Eat_337+gi39.gu577.Eat_336+gi39.gu285.Eat_335+gi39.gu830.Eat_334+gi15.gu831.Eat_298+gi15.gu832.Eat_299+gi15.gu833.Eat_300+gi15.gu35.Eat_301+gi15.gu278.Eat_294+gi15.gu34.Eat_295+gi15.gu556.Eat_296+gi15.gu277.Eat_297+gi15.gu835.Eat_290+gi15.gu557.Eat_291+gi15.gu836.Eat_292+gi15.gu280.Eat_293+gi55.gu837.Eat_286+gi55.gu838.Eat_287+gi15.gu558.Eat_288+gi15.gu279.Eat_289+gi57.gu839.Eat_315+gi57.gu295.Eat_314+gi57.gu33.Eat_317+gi57.gu296.Eat_316+gi57.gu840.Eat_311+gi15.gu841.Eat_310+gi57.gu842.Eat_313+gi57.gu294.Eat_312+gi15.gu276.Eat_307+gi15.gu843.Eat_306+gi15.gu274.Eat_309+gi15.gu275.Eat_308+gi15.gu844.Eat_303+gi15.gu834.Eat_302+gi15.gu576.Eat_305+gi15.gu32.Eat_304+gi29.gu845.Eat_884+gi29.gu470.Eat_885+gi29.gu472.Eat_882+gi29.gu471.Eat_883+gi30.gu846.Eat_880+gi30.gu469.Eat_881+gi30.gu847.Eat_878+gi30.gu610.Eat_879+gi29.gu467.Eat_892+gi29.gu468.Eat_893+gi29.gu848.Eat_890+gi29.gu466.Eat_891+gi29.gu464.Eat_888+gi29.gu465.Eat_889+gi29.gu116.Eat_886+gi29.gu463.Eat_887+gi6.gu849.Eat_869+gi6.gu850.Eat_868+gi6.gu479.Eat_867+gi6.gu851.Eat_866+gi6.gu477.Eat_865+gi6.gu852.Eat_864+gi6.gu117.Eat_863+gi6.gu478.Eat_862+gi30.gu475.Eat_877+gi30.gu476.Eat_876+gi30.gu853.Eat_875+gi30.gu473.Eat_874+gi30.gu854.Eat_873+gi30.gu474.Eat_872+gi30.gu855.Eat_871+gi30.gu856.Eat_870+gi58.gu857.Eat_914+gi58.gu607.Eat_915+gi58.gu124.Eat_916+gi58.gu858.Eat_917+gi58.gu125.Eat_910+gi58.gu456.Eat_911+gi58.gu859.Eat_912+gi58.gu860.Eat_913+gi58.gu861.Eat_922+gi58.gu544.Eat_923+gi58.gu862.Eat_924+gi58.gu863.Eat_925+gi58.gu864.Eat_918+gi58.gu545.Eat_919+gi58.gu865.Eat_920+gi58.gu123.Eat_921+gi28.gu866.Eat_899+gi28.gu611.Eat_898+gi28.gu867.Eat_901+gi28.gu868.Eat_900+gi28.gu869.Eat_895+gi28.gu126.Eat_894+gi28.gu462.Eat_897+gi28.gu461.Eat_896+gi58.gu870.Eat_907+gi28.gu458.Eat_906+gi58.gu459.Eat_909+gi58.gu460.Eat_908+gi28.gu612.Eat_903+gi28.gu871.Eat_902+gi28.gu872.Eat_905+gi28.gu457.Eat_904+gi59.gu873.Eat_944+gi59.gu543.Eat_945+gi59.gu539.Eat_942+gi59.gu874.Eat_943+gi59.gu541.Eat_948+gi59.gu875.Eat_949+gi59.gu542.Eat_946+gi59.gu876.Eat_947+gi36.gu877.Eat_952+gi36.gu536.Eat_953+gi36.gu878.Eat_950+gi36.gu535.Eat_951+gi36.gu879.Eat_956+gi36.gu600.Eat_957+gi36.gu533.Eat_954+gi36.gu532.Eat_955+gi59.gu548.Eat_929+gi59.gu880.Eat_928+gi58.gu881.Eat_927+gi58.gu122.Eat_926+gi59.gu121.Eat_933+gi59.gu547.Eat_932+gi59.gu882.Eat_931+gi59.gu608.Eat_930+gi59.gu883.Eat_937+gi59.gu609.Eat_936+gi59.gu884.Eat_935+gi59.gu546.Eat_934+gi59.gu120.Eat_941+gi59.gu885.Eat_940+gi59.gu886.Eat_939+gi59.gu540.Eat_938+gi35.gu887.Eat_974+gi35.gu531.Eat_975+gi35.gu888.Eat_976+gi35.gu889.Eat_977+gi35.gu529.Eat_978+gi35.gu529.Eat_979+gi35.gu530.Eat_980+gi35.gu890.Eat_981+gi35.gu518.Eat_982+gi35.gu517.Eat_983+gi35.gu516.Eat_984+gi35.gu891.Eat_985+gi43.gu892.Eat_986+gi43.gu521.Eat_987+gi43.gu520.Eat_988+gi43.gu137.Eat_989+gi36.gu893.Eat_959+gi36.gu534.Eat_958+gi36.gu894.Eat_961+gi36.gu538.Eat_960+gi36.gu139.Eat_963+gi36.gu895.Eat_962+gi36.gu896.Eat_965+gi36.gu537.Eat_964+gi36.gu897.Eat_967+gi36.gu527.Eat_966+gi36.gu898.Eat_969+gi36.gu528.Eat_968+gi36.gu138.Eat_971+gi36.gu601.Eat_970+gi35.gu526.Eat_973+gi35.gu525.Eat_972+gi0.gu514.Eat_1000+gi43.gu899.Eat_998+gi43.gu900.Eat_999+gi43.gu901.Eat_996+gi43.gu523.Eat_997+gi43.gu902.Eat_994+gi43.gu524.Eat_995+gi43.gu903.Eat_992+gi43.gu522.Eat_993+gi43.gu519.Eat_990+gi43.gu136.Eat_991+gi47.gu904.Eat_611+gi47.gu367.Eat_610+gi47.gu594.Eat_613+gi47.gu79.Eat_612+gi47.gu905.Eat_607+gi47.gu906.Eat_606+gi47.gu78.Eat_609+gi47.gu366.Eat_608+gi22.gu907.Eat_619+gi47.gu80.Eat_618+gi22.gu374.Eat_621+gi22.gu375.Eat_620+gi47.gu595.Eat_615+gi47.gu908.Eat_614+gi47.gu373.Eat_617+gi47.gu372.Eat_616+gi22.gu909.Eat_626+gi22.gu370.Eat_627+gi22.gu910.Eat_628+gi22.gu371.Eat_629+gi22.gu82.Eat_622+gi22.gu911.Eat_623+gi22.gu912.Eat_624+gi22.gu81.Eat_625+gi4.gu354.Eat_634+gi4.gu913.Eat_635+gi4.gu914.Eat_636+gi4.gu357.Eat_637+gi22.gu355.Eat_630+gi22.gu356.Eat_631+gi22.gu353.Eat_632+gi4.gu83.Eat_633+gi4.gu915.Eat_645+gi4.gu916.Eat_644+gi4.gu352.Eat_643+gi4.gu917.Eat_642+gi4.gu92.Eat_641+gi4.gu351.Eat_640+gi4.gu918.Eat_639+gi4.gu919.Eat_638+gi23.gu920.Eat_653+gi23.gu365.Eat_652+gi23.gu921.Eat_651+gi23.gu90.Eat_650+gi23.gu91.Eat_649+gi23.gu599.Eat_648+gi4.gu364.Eat_647+gi4.gu922.Eat_646+gi42.gu362.Eat_660+gi42.gu361.Eat_661+gi23.gu363.Eat_658+gi42.gu923.Eat_659+gi23.gu358.Eat_656+gi23.gu597.Eat_657+gi23.gu360.Eat_654+gi23.gu359.Eat_655+gi42.gu444.Eat_668+gi42.gu924.Eat_669+gi42.gu925.Eat_666+gi42.gu598.Eat_667+gi42.gu93.Eat_664+gi42.gu926.Eat_665+gi42.gu927.Eat_662+gi42.gu445.Eat_663+gi42.gu448.Eat_671+gi42.gu928.Eat_670+gi42.gu596.Eat_673+gi42.gu449.Eat_672+gi42.gu929.Eat_675+gi42.gu88.Eat_674+gi40.gu930.Eat_677+gi40.gu446.Eat_676+gi40.gu931.Eat_679+gi40.gu447.Eat_678+gi40.gu932.Eat_681+gi40.gu451.Eat_680+gi40.gu933.Eat_683+gi40.gu934.Eat_682+gi40.gu450.Eat_685+gi40.gu935.Eat_684+gi40.gu588.Eat_686+gi40.gu453.Eat_687+gi27.gu454.Eat_688+gi27.gu455.Eat_689+gi27.gu936.Eat_690+gi27.gu937.Eat_691+gi27.gu452.Eat_692+gi27.gu89.Eat_693+gi27.gu432.Eat_694+gi27.gu938.Eat_695+gi27.gu939.Eat_696+gi27.gu940.Eat_697+gi27.gu941.Eat_698+gi26.gu431.Eat_699+gi26.gu430.Eat_700+gi26.gu942.Eat_701+gi26.gu943.Eat_705+gi26.gu944.Eat_704+gi26.gu99.Eat_703+gi26.gu100.Eat_702+gi26.gu945.Eat_709+gi26.gu433.Eat_708+gi26.gu946.Eat_707+gi26.gu434.Eat_706+gi5.gu438.Eat_713+gi5.gu440.Eat_712+gi26.gu439.Eat_711+gi26.gu587.Eat_710+gi5.gu435.Eat_717+gi5.gu947.Eat_716+gi5.gu586.Eat_715+gi5.gu437.Eat_714+gi5.gu443.Eat_720+gi5.gu441.Eat_721+gi5.gu436.Eat_718+gi5.gu442.Eat_719+gi5.gu948.Eat_724+gi5.gu949.Eat_725+gi5.gu103.Eat_722+gi5.gu104.Eat_723+gi5.gu950.Eat_728+gi5.gu951.Eat_729+gi5.gu101.Eat_726+gi5.gu413.Eat_727+gi5.gu102.Eat_732+gi24.gu415.Eat_733+gi5.gu952.Eat_730+gi5.gu414.Eat_731+gi24.gu953.Eat_746+gi24.gu422.Eat_747+gi24.gu95.Eat_748+gi24.gu423.Eat_749+gi24.gu954.Eat_742+gi24.gu955.Eat_743+gi24.gu421.Eat_744+gi24.gu94.Eat_745+gi24.gu418.Eat_738+gi24.gu419.Eat_739+gi24.gu420.Eat_740+gi24.gu956.Eat_741+gi24.gu417.Eat_734+gi24.gu416.Eat_735+gi24.gu96.Eat_736+gi24.gu585.Eat_737+gi25.gi1.gu402.Eat_763+gi25.gi1.gu593.Eat_762+gi25.gi0.gu98.Eat_765+gi25.gi1.gu401.Eat_764+gi25.gi1.gu957.Eat_759+gi25.gi1.gu400.Eat_758+gi25.gi1.gu97.Eat_761+gi25.gi1.gu399.Eat_760+gi25.gi1.gu958.Eat_755+gi25.gi1.gu427.Eat_754+gi25.gi1.gu429.Eat_757+gi25.gi1.gu428.Eat_756+gi24.gu959.Eat_751+gi24.gu424.Eat_750+gi24.gu426.Eat_753+gi24.gu425.Eat_752+gi41.gu407.Eat_780+gi41.gu114.Eat_781+gi41.gu405.Eat_778+gi41.gu960.Eat_779+gi41.gu961.Eat_776+gi41.gu115.Eat_777+gi25.gi0.gu406.Eat_774+gi25.gi0.gu962.Eat_775+gi25.gi0.gu592.Eat_772+gi25.gi0.gu404.Eat_773+gi25.gi0.gu403.Eat_770+gi25.gi0.gu112.Eat_771+gi25.gi0.gu963.Eat_768+gi25.gi0.gu591.Eat_769+gi25.gi0.gu964.Eat_766+gi25.gi0.gu113.Eat_767+gi34.gu965.Eat_797+gi41.gu966.Eat_796+gi41.gu509.Eat_795+gi41.gu111.Eat_794+gi41.gu510.Eat_793+gi41.gu512.Eat_792+gi41.gu511.Eat_791+gi41.gu412.Eat_790+gi41.gu411.Eat_789+gi41.gu967.Eat_788+gi41.gu968.Eat_787+gi41.gu110.Eat_786+gi41.gu590.Eat_785+gi41.gu409.Eat_784+gi41.gu410.Eat_783+gi41.gu408.Eat_782+gi34.gu969.Eat_806+gi34.gu970.Eat_807+gi34.gu501.Eat_808+gi34.gu971.Eat_809+gi34.gu500.Eat_810+gi33.gu109.Eat_811+gi33.gu499.Eat_812+gi33.gu972.Eat_813+gi34.gu507.Eat_798+gi34.gu508.Eat_799+gi34.gu589.Eat_800+gi34.gu505.Eat_801+gi34.gu506.Eat_802+gi34.gu503.Eat_803+gi34.gu504.Eat_804+gi34.gu502.Eat_805+gi33.gu495.Eat_823+gi33.gu108.Eat_822+gi33.gu973.Eat_825+gi33.gu974.Eat_824+gi33.gu604.Eat_827+gi33.gu107.Eat_826+gi33.gu975.Eat_829+gi33.gu494.Eat_828+gi33.gu105.Eat_815+gi33.gu498.Eat_814+gi33.gu497.Eat_817+gi33.gu106.Eat_816+gi33.gu976.Eat_819+gi33.gu496.Eat_818+gi33.gu977.Eat_821+gi33.gu603.Eat_820+gi32.gu490.Eat_840+gi32.gu606.Eat_841+gi32.gu978.Eat_838+gi32.gu489.Eat_839+gi32.gu486.Eat_844+gi31.gu488.Eat_845+gi32.gu605.Eat_842+gi32.gu487.Eat_843+gi32.gu119.Eat_832+gi32.gu493.Eat_833+gi33.gu980.Eat_830+gi33.gu979.Eat_831+gi32.gu981.Eat_836+gi32.gu492.Eat_837+gi32.gu982.Eat_834+gi32.gu491.Eat_835+gi6.gu480.Eat_857+gi6.gu983.Eat_856+gi31.gu118.Eat_855+gi31.gu481.Eat_854+gi6.gu482.Eat_861+gi6.gu483.Eat_860+gi6.gu602.Eat_859+gi6.gu984.Eat_858+gi31.gu985.Eat_849+gi31.gu986.Eat_848+gi31.gu987.Eat_847+gi31.gu988.Eat_846+gi31.gu989.Eat_853+gi31.gu990.Eat_852+gi31.gu484.Eat_851+gi31.gu485.Eat_850 <= 500
FORMULA Philosophers-PT-001000-UpperBounds-05 500 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
Philosophers-PT-001000-UpperBounds-05,0,20.3769,349004,1,0,7,109457,9,1,42987,75283,4

BK_STOP 1622995971012

--------------------
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="Philosophers-PT-001000"
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-PT-001000, 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 r140-tall-162298996000155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-001000.tgz
mv Philosophers-PT-001000 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 ;