Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589792059246

[2020-05-18 08:54:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 08:54:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 08:54:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 08:54:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2020-05-18 08:54:21] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-05-18 08:54:21] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 25 ms.
[2020-05-18 08:54:21] [INFO ] Computed order based on color domains.
[2020-05-18 08:54:21] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 50 ms.
[2020-05-18 08:54:21] [INFO ] Unfolded HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 85 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1189 resets, run finished after 297 ms. (steps per millisecond=33 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0]
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-18 08:54:22] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-05-18 08:54:22] [INFO ] Computed 39 place invariants in 51 ms
[2020-05-18 08:54:22] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2020-05-18 08:54:22] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 10 ms returned unsat
[2020-05-18 08:54:22] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-05-18 08:54:22] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-18 08:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:23] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2020-05-18 08:54:23] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2020-05-18 08:54:23] [INFO ] [Real]Added 1030 Read/Feed constraints in 239 ms returned sat
[2020-05-18 08:54:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-18 08:54:23] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 3 ms returned sat
[2020-05-18 08:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:24] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-05-18 08:54:24] [INFO ] [Nat]Added 1030 Read/Feed constraints in 688 ms returned sat
[2020-05-18 08:54:25] [INFO ] Deduced a trap composed of 40 places in 775 ms
[2020-05-18 08:54:26] [INFO ] Deduced a trap composed of 71 places in 390 ms
[2020-05-18 08:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1644 ms
[2020-05-18 08:54:27] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 637 ms.
[2020-05-18 08:54:28] [INFO ] Added : 25 causal constraints over 5 iterations in 1900 ms. Result :(error "Failed to check-sat")
[2020-05-18 08:54:28] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-18 08:54:28] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 15 ms returned sat
[2020-05-18 08:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:29] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2020-05-18 08:54:29] [INFO ] [Real]Added 1030 Read/Feed constraints in 298 ms returned sat
[2020-05-18 08:54:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-18 08:54:29] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-18 08:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:30] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2020-05-18 08:54:31] [INFO ] [Nat]Added 1030 Read/Feed constraints in 741 ms returned sat
[2020-05-18 08:54:31] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 433 ms.
[2020-05-18 08:54:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t903 0) (and (or (and (> t1 0) (< o1 o903)) (and (> t47 0) (< o47 o903)) (and (> t56 0) (< o56 o903)) (and (> t74 0) (< o74 o903)) (and (> t83 0) (< o83 o903)) (and (> t92 0) (< o92 o903)) (and (> t101 0) (< o101 o903)) (and (> t110 0) (< o110 o903)) (and (> t119 0) (< o119 o903)) (and (> t128 0) (< o128 o903)) (and (> t153 0) (< o153 o903)) (and (> t233 0) (< o233 o903)) (and (> t314 0) (< o314 o903)) (and (> t395 0) (< o395 o903)) (and (> t476 0) (< o476 o903)) (and (> t557 0) (< o557 o903)) (and (> t638 0) (< o638 o903)) (and (> t719 0) (< o719 o903)) (and (> t800 0) (< o800 o903)) (and (> t884 0) (< o884 o903)) (and (> t886 0) (< o886 o903)) (and (> t887 0) (< o887 o903)) (and (> t888 0) (< o888 o903)) (and (> t889 0) (< o889 o903)) (and (> t890 0) (< o890 o903)) (and (> t891 0) (< o891 o903)) (and (> t892 0) (< o892 o903))) (or (and (> t8 0) (< o8 o903)) (and (> t83 0) (< o83 o903)) (and (> t170 0) (< o170 o903)) (and (> t219 0) (< o219 o903)) (and (> t227 0) (< o227 o903)) (and (> t236 0) (< o236 o903)) (and (> t244 0) (< o244 o903)) (and (> t261 0) (< o261 o903)) (and (> t269 0) (< o269 o903)) (and (> t277 0) (< o277 o903)) (and (> t285 0) (< o285 o903)) (and (> t293 0) (< o293 o903)) (and (> t333 0) (< o333 o903)) (and (> t413 0) (< o413 o903)) (and (> t494 0) (< o494 o903)) (and (> t575 0) (< o575 o903)) (and (> t656 0) (< o656 o903)) (and (> t737 0) (< o737 o903)) (and (> t818 0) (< o818 o903)) (and (> t1070 0) (< o1070 o903)) (and (> t1071 0) (< o1071 o903)) (and (> t1072 0) (< o1072 o903)) (and (> t1073 0) (< o1073 o903)) (and (> t1074 0) (< o1074 o903)) (and (> t1075 0) (< o1075 o903)) (and (> t1076 0) (< o1076 o903)) (and (> t1077 0) (< o1077 o903))) (or (and (> t1 0) (< o1 o903)) (and (> t2 0) (< o2 o903)) (and (> t5 0) (< o5 o903)) (and (> t8 0) (< o8 o903)) (and (> t12 0) (< o12 o903)) (and (> t17 0) (< o17 o903)) (and (> t23 0) (< o23 o903)) (and (> t30 0) (< o30 o903)) (and (> t38 0) (< o38 o903)) (and (> t47 0) (< o47 o903)) (and (> t56 0) (< o56 o903)) (and (> t65 0) (< o65 o903)) (and (> t74 0) (< o74 o903)) (and (> t83 0) (< o83 o903)) (and (> t92 0) (< o92 o903)) (and (> t101 0) (< o101 o903)) (and (> t110 0) (< o110 o903)) (and (> t119 0) (< o119 o903)) (and (> t128 0) (< o128 o903)) (and (> t136 0) (< o136 o903)) (and (> t145 0) (< o145 o903)) (and (> t162 0) (< o162 o903)) (and (> t170 0) (< o170 o903)) (and (> t178 0) (< o178 o903)) (and (> t186 0) (< o186 o903)) (and (> t194 0) (< o194 o903)) (and (> t202 0) (< o202 o903)) (and (> t210 0) (< o210 o903)) (and (> t299 0) (< o299 o903)) (and (> t307 0) (< o307 o903)) (and (> t324 0) (< o324 o903)) (and (> t333 0) (< o333 o903)) (and (> t341 0) (< o341 o903)) (and (> t349 0) (< o349 o903)) (and (> t357 0) (< o357 o903)) (and (> t365 0) (< o365 o903)) (and (> t373 0) (< o373 o903)) (and (> t380 0) (< o380 o903)) (and (> t388 0) (< o388 o903)) (and (> t405 0) (< o405 o903)) (and (> t413 0) (< o413 o903)) (and (> t422 0) (< o422 o903)) (and (> t430 0) (< o430 o903)) (and (> t438 0) (< o438 o903)) (and (> t446 0) (< o446 o903)) (and (> t454 0) (< o454 o903)) (and (> t461 0) (< o461 o903)) (and (> t469 0) (< o469 o903)) (and (> t486 0) (< o486 o903)) (and (> t494 0) (< o494 o903)) (and (> t502 0) (< o502 o903)) (and (> t511 0) (< o511 o903)) (and (> t519 0) (< o519 o903)) (and (> t527 0) (< o527 o903)) (and (> t535 0) (< o535 o903)) (and (> t542 0) (< o542 o903)) (and (> t550 0) (< o550 o903)) (and (> t567 0) (< o567 o903)) (and (> t575 0) (< o575 o903)) (and (> t583 0) (< o583 o903)) (and (> t591 0) (< o591 o903)) (and (> t600 0) (< o600 o903)) (and (> t608 0) (< o608 o903)) (and (> t616 0) (< o616 o903)) (and (> t623 0) (< o623 o903)) (and (> t631 0) (< o631 o903)) (and (> t648 0) (< o648 o903)) (and (> t656 0) (< o656 o903)) (and (> t664 0) (< o664 o903)) (and (> t672 0) (< o672 o903)) (and (> t680 0) (< o680 o903)) (and (> t689 0) (< o689 o903)) (and (> t697 0) (< o697 o903)) (and (> t704 0) (< o704 o903)) (and (> t712 0) (< o712 o903)) (and (> t729 0) (< o729 o903)) (and (> t737 0) (< o737 o903)) (and (> t745 0) (< o745 o903)) (and (> t753 0) (< o753 o903)) (and (> t761 0) (< o761 o903)) (and (> t769 0) (< o769 o903)) (and (> t778 0) (< o778 o903)) (and (> t785 0) (< o785 o903)) (and (> t793 0) (< o793 o903)) (and (> t810 0) (< o810 o903)) (and (> t818 0) (< o818 o903)) (and (> t826 0) (< o826 o903)) (and (> t834 0) (< o834 o903)) (and (> t842 0) (< o842 o903)) (and (> t850 0) (< o850 o903)) (and (> t858 0) (< o858 o903)) (and (> t1797 0) (< o1797 o903)) (and (> t1807 0) (< o1807 o903)) (and (> t1817 0) (< o1817 o903)) (and (> t1827 0) (< o1827 o903)) (and (> t1837 0) (< o1837 o903)) (and (> t1847 0) (< o1847 o903)) (and (> t1857 0) (< o1857 o903)) (and (> t1867 0) (< o1867 o903)) (and (> t1877 0) (< o1877 o903)) (and (> t1887 0) (< o1887 o903))) (or (and (> t1 0) (< o1 o903)) (and (> t2 0) (< o2 o903)) (and (> t5 0) (< o5 o903)) (and (> t8 0) (< o8 o903)) (and (> t12 0) (< o12 o903)) (and (> t17 0) (< o17 o903)) (and (> t23 0) (< o23 o903)) (and (> t30 0) (< o30 o903)) (and (> t38 0) (< o38 o903)) (and (> t1797 0) (< o1797 o903)) (and (> t1807 0) (< o1807 o903)) (and (> t1815 0) (< o1815 o903)) (and (> t1816 0) (< o1816 o903)) (and (> t1817 0) (< o1817 o903)) (and (> t1818 0) (< o1818 o903)) (and (> t1819 0) (< o1819 o903)) (and (> t1820 0) (< o1820 o903)) (and (> t1821 0) (< o1821 o903)) (and (> t1822 0) (< o1822 o903)) (and (> t1823 0) (< o1823 o903)) (and (> t1824 0) (< o1824 o903)) (and (> t1827 0) (< o1827 o903)) (and (> t1837 0) (< o1837 o903)) (and (> t1847 0) (< o1847 o903)) (and (> t1857 0) (< o1857 o903)) (and (> t1867 0) (< o1867 o903)) (and (> t1877 0) (< o1877 o903)) (and (> t1887 0) (< o1887 o903)))))") while checking expression at index 2
[2020-05-18 08:54:34] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-18 08:54:34] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-18 08:54:34] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-18 08:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:35] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-05-18 08:54:36] [INFO ] [Real]Added 1030 Read/Feed constraints in 333 ms returned sat
[2020-05-18 08:54:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-18 08:54:36] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 10 ms returned sat
[2020-05-18 08:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:36] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2020-05-18 08:54:37] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1133 ms returned sat
[2020-05-18 08:54:38] [INFO ] Deduced a trap composed of 69 places in 356 ms
[2020-05-18 08:54:38] [INFO ] Deduced a trap composed of 40 places in 379 ms
[2020-05-18 08:54:39] [INFO ] Deduced a trap composed of 75 places in 399 ms
[2020-05-18 08:54:39] [INFO ] Deduced a trap composed of 53 places in 391 ms
[2020-05-18 08:54:41] [INFO ] Deduced a trap composed of 64 places in 1029 ms
[2020-05-18 08:54:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s6 s10 s26 s30 s31 s32 s33 s56 s61 s63 s64 s66 s67 s69 s70 s71 s72 s86 s90 s91 s92 s93 s94 s95 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s120 s121 s122 s123 s124 s125 s127 s128 s129 s150 s151 s152 s153 s154 s155 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168) 0)") while checking expression at index 4
[2020-05-18 08:54:41] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-05-18 08:54:41] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-18 08:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:41] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2020-05-18 08:54:42] [INFO ] [Real]Added 1030 Read/Feed constraints in 241 ms returned sat
[2020-05-18 08:54:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-05-18 08:54:42] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 15 ms returned sat
[2020-05-18 08:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:43] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2020-05-18 08:54:43] [INFO ] [Nat]Added 1030 Read/Feed constraints in 724 ms returned sat
[2020-05-18 08:54:44] [INFO ] Deduced a trap composed of 48 places in 362 ms
[2020-05-18 08:54:44] [INFO ] Deduced a trap composed of 55 places in 366 ms
[2020-05-18 08:54:44] [INFO ] Deduced a trap composed of 54 places in 321 ms
[2020-05-18 08:54:45] [INFO ] Deduced a trap composed of 48 places in 307 ms
[2020-05-18 08:54:45] [INFO ] Deduced a trap composed of 48 places in 374 ms
[2020-05-18 08:54:46] [INFO ] Deduced a trap composed of 45 places in 372 ms
[2020-05-18 08:54:46] [INFO ] Deduced a trap composed of 48 places in 350 ms
[2020-05-18 08:54:46] [INFO ] Deduced a trap composed of 61 places in 344 ms
[2020-05-18 08:54:47] [INFO ] Deduced a trap composed of 48 places in 370 ms
[2020-05-18 08:54:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s7 s37 s47 s57 s67 s71 s72 s77 s78 s79 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s120 s121 s122 s123 s124 s125 s126 s128 s129 s150 s151 s152 s153 s154 s155 s156 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169) 0)") while checking expression at index 5
[2020-05-18 08:54:47] [INFO ] [Real]Absence check using 30 positive place invariants in 1 ms returned unsat
[2020-05-18 08:54:47] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-18 08:54:47] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-18 08:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:48] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-18 08:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-18 08:54:48] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-18 08:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:48] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2020-05-18 08:54:49] [INFO ] [Nat]Added 1030 Read/Feed constraints in 917 ms returned sat
[2020-05-18 08:54:50] [INFO ] Computed and/alt/rep : 2220/268350/1860 causal constraints in 218 ms.
[2020-05-18 08:54:53] [INFO ] Added : 55 causal constraints over 11 iterations in 3395 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-18 08:54:53] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-05-18 08:54:53] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 14 ms returned sat
[2020-05-18 08:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:54] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2020-05-18 08:54:54] [INFO ] [Real]Added 1030 Read/Feed constraints in 326 ms returned sat
[2020-05-18 08:54:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:54:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-18 08:54:54] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 10 ms returned sat
[2020-05-18 08:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:54:55] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2020-05-18 08:54:56] [INFO ] [Nat]Added 1030 Read/Feed constraints in 825 ms returned sat
[2020-05-18 08:54:56] [INFO ] Deduced a trap composed of 60 places in 409 ms
[2020-05-18 08:54:57] [INFO ] Deduced a trap composed of 59 places in 459 ms
[2020-05-18 08:54:57] [INFO ] Deduced a trap composed of 58 places in 434 ms
[2020-05-18 08:54:58] [INFO ] Deduced a trap composed of 61 places in 425 ms
[2020-05-18 08:54:58] [INFO ] Deduced a trap composed of 56 places in 369 ms
[2020-05-18 08:54:59] [INFO ] Deduced a trap composed of 81 places in 385 ms
[2020-05-18 08:54:59] [INFO ] Deduced a trap composed of 85 places in 390 ms
[2020-05-18 08:54:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-18 08:55:00] [INFO ] Deduced a trap composed of 4 places in 484 ms
[2020-05-18 08:55:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s104 s114 s144 s164) 0)") while checking expression at index 8
[2020-05-18 08:55:00] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-18 08:55:00] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 7 ms returned sat
[2020-05-18 08:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:55:00] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-05-18 08:55:00] [INFO ] [Real]Added 1030 Read/Feed constraints in 232 ms returned sat
[2020-05-18 08:55:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:55:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-05-18 08:55:01] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 10 ms returned sat
[2020-05-18 08:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:55:01] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-05-18 08:55:02] [INFO ] [Nat]Added 1030 Read/Feed constraints in 700 ms returned sat
[2020-05-18 08:55:03] [INFO ] Deduced a trap composed of 73 places in 382 ms
[2020-05-18 08:55:03] [INFO ] Deduced a trap composed of 53 places in 293 ms
[2020-05-18 08:55:03] [INFO ] Deduced a trap composed of 71 places in 329 ms
[2020-05-18 08:55:04] [INFO ] Deduced a trap composed of 69 places in 248 ms
[2020-05-18 08:55:04] [INFO ] Deduced a trap composed of 63 places in 300 ms
[2020-05-18 08:55:04] [INFO ] Deduced a trap composed of 63 places in 237 ms
[2020-05-18 08:55:04] [INFO ] Deduced a trap composed of 55 places in 255 ms
[2020-05-18 08:55:05] [INFO ] Deduced a trap composed of 64 places in 272 ms
[2020-05-18 08:55:05] [INFO ] Deduced a trap composed of 60 places in 285 ms
[2020-05-18 08:55:05] [INFO ] Deduced a trap composed of 71 places in 317 ms
[2020-05-18 08:55:06] [INFO ] Deduced a trap composed of 4 places in 331 ms
[2020-05-18 08:55:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s104 s114 s144 s164) 0)") while checking expression at index 9
[2020-05-18 08:55:06] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-05-18 08:55:06] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 5 ms returned sat
[2020-05-18 08:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:55:07] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-18 08:55:07] [INFO ] [Real]Added 1030 Read/Feed constraints in 264 ms returned sat
[2020-05-18 08:55:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:55:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-18 08:55:07] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2020-05-18 08:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:55:08] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-05-18 08:55:08] [INFO ] [Nat]Added 1030 Read/Feed constraints in 610 ms returned sat
[2020-05-18 08:55:09] [INFO ] Deduced a trap composed of 48 places in 348 ms
[2020-05-18 08:55:09] [INFO ] Deduced a trap composed of 69 places in 327 ms
[2020-05-18 08:55:09] [INFO ] Deduced a trap composed of 66 places in 289 ms
[2020-05-18 08:55:10] [INFO ] Deduced a trap composed of 78 places in 291 ms
[2020-05-18 08:55:10] [INFO ] Deduced a trap composed of 78 places in 292 ms
[2020-05-18 08:55:10] [INFO ] Deduced a trap composed of 51 places in 257 ms
[2020-05-18 08:55:10] [INFO ] Deduced a trap composed of 40 places in 249 ms
[2020-05-18 08:55:11] [INFO ] Deduced a trap composed of 58 places in 369 ms
[2020-05-18 08:55:11] [INFO ] Deduced a trap composed of 63 places in 243 ms
[2020-05-18 08:55:12] [INFO ] Deduced a trap composed of 58 places in 230 ms
[2020-05-18 08:55:12] [INFO ] Deduced a trap composed of 73 places in 404 ms
[2020-05-18 08:55:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2 s7 s9 s10 s11 s21 s22 s30 s31 s32 s33 s34 s40 s41 s42 s43 s44 s45 s46 s50 s60 s61 s62 s63 s64 s65 s66 s67 s68 s71 s72 s73 s80 s81 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s121 s122 s123 s124 s125 s126 s127 s128 s129 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169) 0)") while checking expression at index 10
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 221 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2020-05-18 08:55:12] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-05-18 08:55:12] [INFO ] Computed 39 place invariants in 25 ms
[2020-05-18 08:55:14] [INFO ] Dead Transitions using invariants and state equation in 2010 ms returned [45, 55, 56, 65, 67, 75, 78, 85, 89, 95, 100, 105, 111, 115, 122, 125, 133, 135, 144, 145, 146, 156, 166, 167, 176, 178, 186, 189, 196, 200, 206, 211, 216, 222, 226, 233, 236, 244, 245, 247, 256, 257, 267, 277, 278, 287, 289, 297, 300, 307, 311, 317, 322, 327, 333, 337, 344, 345, 348, 356, 358, 367, 368, 378, 388, 389, 398, 400, 408, 411, 418, 422, 428, 433, 438, 444, 445, 449, 456, 459, 467, 469, 478, 479, 489, 499, 500, 509, 511, 519, 522, 529, 533, 539, 544, 545, 550, 556, 560, 567, 570, 578, 580, 589, 590, 600, 610, 611, 620, 622, 630, 633, 640, 644, 645, 651, 656, 661, 667, 671, 678, 681, 689, 691, 700, 701, 711, 721, 722, 731, 733, 741, 744, 745, 752, 756, 762, 767, 772, 778, 782, 789, 792, 800, 802, 811, 812, 822, 832, 833, 842, 844, 845, 853, 856, 863, 867, 873, 878, 883, 889, 893, 900, 903, 911, 913, 922, 923, 933, 943, 944, 945, 954, 956, 964, 967, 974, 978, 984, 989, 994, 1000, 1004, 1011, 1014, 1022, 1024, 1033, 1034, 1044, 1045, 1055, 1056, 1065, 1067, 1075, 1078, 1085, 1089, 1095, 1100, 1105, 1111, 1115, 1122, 1125, 1133, 1135, 1144, 1145, 1146, 1156, 1166, 1167, 1176, 1178, 1186, 1189, 1196, 1200, 1206, 1211, 1216, 1222, 1226, 1233, 1236, 1244, 1245, 1247, 1256, 1257, 1267, 1277, 1278, 1287, 1289, 1297, 1300, 1307, 1311, 1317, 1322, 1327, 1333, 1337, 1344, 1345, 1348, 1356, 1358, 1367, 1368, 1378, 1388, 1389, 1398, 1400, 1408, 1411, 1418, 1422, 1428, 1433, 1438, 1444, 1445, 1449, 1456, 1459, 1467, 1469, 1478, 1479, 1489, 1499, 1500, 1509, 1511, 1519, 1522, 1529, 1533, 1539, 1544, 1545, 1550, 1556, 1560, 1567, 1570, 1578, 1580, 1589, 1590, 1600, 1610, 1611, 1620, 1622, 1630, 1633, 1640, 1644, 1645, 1651, 1656, 1661, 1667, 1671, 1678, 1681, 1689, 1691, 1700, 1701, 1711, 1721, 1722, 1731, 1733, 1741, 1744, 1745, 1752, 1756, 1762, 1767, 1772, 1778, 1782, 1789, 1792, 1800, 1802, 1811, 1812, 1822, 1832, 1833, 1842, 1844, 1845, 1853, 1856, 1863, 1867, 1873, 1878, 1883, 1889, 1893, 1900, 1903, 1911, 1913, 1922, 1923, 1933, 1943, 1944, 1945, 1954, 1956, 1964, 1967, 1974, 1978, 1984, 1989, 1994, 2000, 2004, 2011, 2014, 2022, 2024, 2033, 2034, 2044]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2044, 2034, 2033, 2024, 2022, 2014, 2011, 2004, 2000, 1994, 1989, 1984, 1978, 1974, 1967, 1964, 1956, 1954, 1945, 1944, 1943, 1933, 1923, 1922, 1913, 1911, 1903, 1900, 1893, 1889, 1883, 1878, 1873, 1867, 1863, 1856, 1853, 1845, 1844, 1842, 1833, 1832, 1822, 1812, 1811, 1802, 1800, 1792, 1789, 1782, 1778, 1772, 1767, 1762, 1756, 1752, 1745, 1744, 1741, 1733, 1731, 1722, 1721, 1711, 1701, 1700, 1691, 1689, 1681, 1678, 1671, 1667, 1661, 1656, 1651, 1645, 1644, 1640, 1633, 1630, 1622, 1620, 1611, 1610, 1600, 1590, 1589, 1580, 1578, 1570, 1567, 1560, 1556, 1550, 1545, 1544, 1539, 1533, 1529, 1522, 1519, 1511, 1509, 1500, 1499, 1489, 1479, 1478, 1469, 1467, 1459, 1456, 1449, 1445, 1444, 1438, 1433, 1428, 1422, 1418, 1411, 1408, 1400, 1398, 1389, 1388, 1378, 1368, 1367, 1358, 1356, 1348, 1345, 1344, 1337, 1333, 1327, 1322, 1317, 1311, 1307, 1300, 1297, 1289, 1287, 1278, 1277, 1267, 1257, 1256, 1247, 1245, 1244, 1236, 1233, 1226, 1222, 1216, 1211, 1206, 1200, 1196, 1189, 1186, 1178, 1176, 1167, 1166, 1156, 1146, 1145, 1144, 1135, 1133, 1125, 1122, 1115, 1111, 1105, 1100, 1095, 1089, 1085, 1078, 1075, 1067, 1065, 1056, 1055, 1045, 1044, 1034, 1033, 1024, 1022, 1014, 1011, 1004, 1000, 994, 989, 984, 978, 974, 967, 964, 956, 954, 945, 944, 943, 933, 923, 922, 913, 911, 903, 900, 893, 889, 883, 878, 873, 867, 863, 856, 853, 845, 844, 842, 833, 832, 822, 812, 811, 802, 800, 792, 789, 782, 778, 772, 767, 762, 756, 752, 745, 744, 741, 733, 731, 722, 721, 711, 701, 700, 691, 689, 681, 678, 671, 667, 661, 656, 651, 645, 644, 640, 633, 630, 622, 620, 611, 610, 600, 590, 589, 580, 578, 570, 567, 560, 556, 550, 545, 544, 539, 533, 529, 522, 519, 511, 509, 500, 499, 489, 479, 478, 469, 467, 459, 456, 449, 445, 444, 438, 433, 428, 422, 418, 411, 408, 400, 398, 389, 388, 378, 368, 367, 358, 356, 348, 345, 344, 337, 333, 327, 322, 317, 311, 307, 300, 297, 289, 287, 278, 277, 267, 257, 256, 247, 245, 244, 236, 233, 226, 222, 216, 211, 206, 200, 196, 189, 186, 178, 176, 167, 166, 156, 146, 145, 144, 135, 133, 125, 122, 115, 111, 105, 100, 95, 89, 85, 78, 75, 67, 65, 56, 55, 45]
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 86 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
Incomplete random walk after 1000000 steps, including 119314 resets, run finished after 8785 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9128 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8519 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9039 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9243 resets, run finished after 1607 ms. (steps per millisecond=622 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6006 resets, run finished after 1292 ms. (steps per millisecond=773 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8514 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9049 resets, run finished after 1396 ms. (steps per millisecond=716 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9040 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 199049 states, properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 816347 steps, saw 199049 distinct states, run finished after 5124 ms. (steps per millisecond=159 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Explored full state space saw : 199051 states, properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Exhaustive walk after 816356 steps, saw 199051 distinct states, run finished after 5036 ms. (steps per millisecond=162 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589792145889

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390000206"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;