Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445000013.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 14:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-COL-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716840661828

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:03] [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.
[2024-05-27 20:11:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2024-05-27 20:11:03] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 7
[2024-05-27 20:11:03] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2024-05-27 20:11:03] [INFO ] Skeletonized 7 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:04] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0] Max Struct:[10, 10, 10, 10, +inf, 10, 10]
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 20:11:04] [INFO ] Invariant cache hit.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 20:11:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:11:04] [INFO ] Added : 4 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 16 ms.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:11:04] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Added 4 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:11:04] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:11:04] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:11:04] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-27 20:11:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 20:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:11:04] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:11:04] [INFO ] Added : 4 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, +inf, 10, 10]
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:04] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 60 ms.
[2024-05-27 20:11:04] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, +inf, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, +inf, 10, 10]
[2024-05-27 20:11:04] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 20:11:04] [INFO ] Computed 39 invariants in 80 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, +inf, 10, 10]
RANDOM walk for 10000 steps (1185 resets) in 243 ms. (40 steps per ms)
BEST_FIRST walk for 60006 steps (505 resets) in 101 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
[2024-05-27 20:11:05] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 20:11:05] [INFO ] Invariant cache hit.
[2024-05-27 20:11:05] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-27 20:11:05] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 20:11:05] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-27 20:11:06] [INFO ] [Real]Added 1030 Read/Feed constraints in 305 ms returned sat
[2024-05-27 20:11:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2024-05-27 20:11:06] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 20:11:06] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-27 20:11:07] [INFO ] [Nat]Added 1030 Read/Feed constraints in 578 ms returned sat
[2024-05-27 20:11:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 430 ms.
[2024-05-27 20:11:08] [INFO ] Added : 0 causal constraints over 0 iterations in 613 ms. Result :sat
Minimization took 607 ms.
[2024-05-27 20:11:08] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2024-05-27 20:11:08] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 20:11:09] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-05-27 20:11:09] [INFO ] [Real]Added 1030 Read/Feed constraints in 445 ms returned sat
[2024-05-27 20:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2024-05-27 20:11:09] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-27 20:11:10] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2024-05-27 20:11:10] [INFO ] [Nat]Added 1030 Read/Feed constraints in 365 ms returned sat
[2024-05-27 20:11:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 225 ms.
[2024-05-27 20:11:10] [INFO ] Added : 0 causal constraints over 0 iterations in 398 ms. Result :sat
Minimization took 592 ms.
[2024-05-27 20:11:11] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-27 20:11:11] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-27 20:11:11] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-27 20:11:12] [INFO ] [Real]Added 1030 Read/Feed constraints in 326 ms returned sat
[2024-05-27 20:11:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-27 20:11:12] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 20:11:12] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-27 20:11:12] [INFO ] [Nat]Added 1030 Read/Feed constraints in 224 ms returned sat
[2024-05-27 20:11:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 256 ms.
[2024-05-27 20:11:13] [INFO ] Added : 0 causal constraints over 0 iterations in 475 ms. Result :sat
Minimization took 594 ms.
[2024-05-27 20:11:14] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2024-05-27 20:11:14] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-27 20:11:14] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-27 20:11:14] [INFO ] [Real]Added 1030 Read/Feed constraints in 242 ms returned sat
[2024-05-27 20:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-27 20:11:14] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-27 20:11:15] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2024-05-27 20:11:15] [INFO ] [Nat]Added 1030 Read/Feed constraints in 470 ms returned sat
[2024-05-27 20:11:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 241 ms.
[2024-05-27 20:11:16] [INFO ] Added : 0 causal constraints over 0 iterations in 452 ms. Result :sat
Minimization took 618 ms.
[2024-05-27 20:11:16] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-27 20:11:16] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-27 20:11:17] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-27 20:11:17] [INFO ] [Real]Added 1030 Read/Feed constraints in 475 ms returned sat
[2024-05-27 20:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-27 20:11:17] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-27 20:11:18] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-27 20:11:18] [INFO ] [Nat]Added 1030 Read/Feed constraints in 493 ms returned sat
[2024-05-27 20:11:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 273 ms.
[2024-05-27 20:11:19] [INFO ] Added : 0 causal constraints over 0 iterations in 487 ms. Result :sat
Minimization took 593 ms.
[2024-05-27 20:11:20] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2024-05-27 20:11:20] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-27 20:11:20] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-27 20:11:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:11:21] [INFO ] [Real]Added 1030 Read/Feed constraints in 859 ms returned sat
[2024-05-27 20:11:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2024-05-27 20:11:21] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-27 20:11:22] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-05-27 20:11:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:11:22] [INFO ] [Nat]Added 1030 Read/Feed constraints in 684 ms returned sat
[2024-05-27 20:11:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 247 ms.
[2024-05-27 20:11:23] [INFO ] Added : 0 causal constraints over 0 iterations in 464 ms. Result :sat
Minimization took 596 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 210 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 20:11:24] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 20:11:24] [INFO ] Invariant cache hit.
[2024-05-27 20:11:24] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 35854ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 35912ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 84 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36244 ms. Remains : 170/170 places, 1885/2265 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:12:00] [INFO ] Computed 39 invariants in 80 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
RANDOM walk for 1000000 steps (119340 resets) in 8317 ms. (120 steps per ms)
BEST_FIRST walk for 6000006 steps (51125 resets) in 7064 ms. (849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
[2024-05-27 20:12:16] [INFO ] Invariant cache hit.
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-05-27 20:12:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:12:18] [INFO ] [Real]Added 1010 Read/Feed constraints in 1636 ms returned sat
[2024-05-27 20:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:18] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-27 20:12:18] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-05-27 20:12:19] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1002 ms returned sat
[2024-05-27 20:12:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 220 ms.
[2024-05-27 20:12:20] [INFO ] Added : 0 causal constraints over 0 iterations in 406 ms. Result :sat
Minimization took 4511 ms.
[2024-05-27 20:12:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:24] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2024-05-27 20:12:25] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-27 20:12:26] [INFO ] [Real]Added 1010 Read/Feed constraints in 1673 ms returned sat
[2024-05-27 20:12:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:27] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-27 20:12:27] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-05-27 20:12:29] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1824 ms returned sat
[2024-05-27 20:12:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 204 ms.
[2024-05-27 20:12:29] [INFO ] Added : 0 causal constraints over 0 iterations in 364 ms. Result :sat
Minimization took 4503 ms.
[2024-05-27 20:12:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:12:34] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2024-05-27 20:12:34] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2024-05-27 20:12:34] [INFO ] [Real]Added 1010 Read/Feed constraints in 293 ms returned sat
[2024-05-27 20:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2024-05-27 20:12:35] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-05-27 20:12:36] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1297 ms returned sat
[2024-05-27 20:12:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 195 ms.
[2024-05-27 20:12:36] [INFO ] Added : 0 causal constraints over 0 iterations in 339 ms. Result :sat
Minimization took 4511 ms.
[2024-05-27 20:12:41] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-27 20:12:41] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2024-05-27 20:12:41] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2024-05-27 20:12:43] [INFO ] [Real]Added 1010 Read/Feed constraints in 1477 ms returned sat
[2024-05-27 20:12:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-27 20:12:43] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-05-27 20:12:46] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2958 ms returned sat
[2024-05-27 20:12:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 216 ms.
[2024-05-27 20:12:47] [INFO ] Added : 0 causal constraints over 0 iterations in 377 ms. Result :sat
Minimization took 4503 ms.
[2024-05-27 20:12:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:51] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2024-05-27 20:12:51] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-27 20:12:52] [INFO ] [Real]Added 1010 Read/Feed constraints in 347 ms returned sat
[2024-05-27 20:12:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:12:52] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2024-05-27 20:12:52] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2024-05-27 20:12:54] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1287 ms returned sat
[2024-05-27 20:12:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 208 ms.
[2024-05-27 20:12:54] [INFO ] Added : 0 causal constraints over 0 iterations in 390 ms. Result :sat
Minimization took 4505 ms.
[2024-05-27 20:12:59] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-27 20:12:59] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2024-05-27 20:12:59] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-05-27 20:13:03] [INFO ] [Real]Added 1010 Read/Feed constraints in 3599 ms returned sat
[2024-05-27 20:13:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:13:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:13:03] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2024-05-27 20:13:03] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-05-27 20:13:05] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1741 ms returned sat
[2024-05-27 20:13:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 215 ms.
[2024-05-27 20:13:05] [INFO ] Added : 0 causal constraints over 0 iterations in 394 ms. Result :sat
Minimization took 4502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 4, 2, 4, 4] Max Struct:[10, 10, 10, +inf, 10, 10]
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 142 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 104 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:13:10] [INFO ] Invariant cache hit.
[2024-05-27 20:13:10] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 20:13:10] [INFO ] Invariant cache hit.
[2024-05-27 20:13:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:13:17] [INFO ] Implicit Places using invariants and state equation in 7361 ms returned []
Implicit Place search using SMT with State Equation took 7524 ms to find 0 implicit places.
[2024-05-27 20:13:18] [INFO ] Redundant transitions in 173 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:13:18] [INFO ] Invariant cache hit.
[2024-05-27 20:13:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42242ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50093 ms. Remains : 170/170 places, 1885/1885 transitions.
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (4781 resets) in 2237 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (385 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (388 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (281 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (279 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (284 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (282 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (337 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (381 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (382 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (360 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (360 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 197247 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 11
Probabilistic random walk after 197247 steps, saw 51031 distinct states, run finished after 3005 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-27 20:14:05] [INFO ] Invariant cache hit.
[2024-05-27 20:14:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 9/159 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1220 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 11/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 9/159 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:14:11] [INFO ] Deduced a trap composed of 69 places in 254 ms of which 2 ms to minimize.
[2024-05-27 20:14:11] [INFO ] Deduced a trap composed of 76 places in 286 ms of which 2 ms to minimize.
[2024-05-27 20:14:11] [INFO ] Deduced a trap composed of 85 places in 267 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:14:12] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 2 ms to minimize.
[2024-05-27 20:14:12] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 1 ms to minimize.
[2024-05-27 20:14:12] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 1 ms to minimize.
[2024-05-27 20:14:12] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2055 variables, 170/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1227 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 10186ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 117 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:14:15] [INFO ] Invariant cache hit.
[2024-05-27 20:14:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32180ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32327 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4755 resets) in 825 ms. (48 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (394 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (392 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (283 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (280 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (280 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (281 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (339 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (381 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (380 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (360 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (360 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 191737 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 11
Probabilistic random walk after 191737 steps, saw 49545 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-27 20:14:51] [INFO ] Invariant cache hit.
[2024-05-27 20:14:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 9/159 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:14:52] [INFO ] Deduced a trap composed of 70 places in 261 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1885/2055 variables, 170/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2055 variables, 1010/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1220 constraints, problems are : Problem set: 0 solved, 11 unsolved in 39731 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 11/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 9/159 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/170 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:15:32] [INFO ] Deduced a trap composed of 69 places in 307 ms of which 5 ms to minimize.
[2024-05-27 20:15:32] [INFO ] Deduced a trap composed of 76 places in 294 ms of which 1 ms to minimize.
[2024-05-27 20:15:32] [INFO ] Deduced a trap composed of 85 places in 248 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-27 20:15:33] [INFO ] Deduced a trap composed of 71 places in 304 ms of which 1 ms to minimize.
[2024-05-27 20:15:33] [INFO ] Deduced a trap composed of 66 places in 318 ms of which 1 ms to minimize.
[2024-05-27 20:15:33] [INFO ] Deduced a trap composed of 69 places in 291 ms of which 2 ms to minimize.
[2024-05-27 20:15:34] [INFO ] Deduced a trap composed of 77 places in 298 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1885/2055 variables, 170/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1227 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 84858ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 69 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:16:16] [INFO ] Invariant cache hit.
[2024-05-27 20:16:16] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 20:16:16] [INFO ] Invariant cache hit.
[2024-05-27 20:16:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:16:23] [INFO ] Implicit Places using invariants and state equation in 6678 ms returned []
Implicit Place search using SMT with State Equation took 6823 ms to find 0 implicit places.
[2024-05-27 20:16:23] [INFO ] Redundant transitions in 111 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:16:23] [INFO ] Invariant cache hit.
[2024-05-27 20:16:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-10

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 8
TRANSITIONS: 7
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 4
ARCS: 33
LOADING TIME: 0.137

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 170
TRANSITIONS: 2310
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18190
UNFOLDING TIME: 0.391

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.134
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.826
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 808
MODEL NAME: /home/mcc/execution/model
170 places, 2310 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PhilosophersDyn-COL-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-04 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-03 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-05 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-08 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-10 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-11 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-09 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-12 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-15 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-UpperBounds-14 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716841036710

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PhilosophersDyn-COL-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445000013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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