fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961258000695
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Peterson-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.840 223403.00 261626.00 173.60 FTTTTTTTTFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258000695.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.0K 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 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 46K 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 Peterson-COL-6-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590022624110

[2020-05-21 00:57:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-21 00:57:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 00:57:07] [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-21 00:57:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 918 ms
[2020-05-21 00:57:08] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-05-21 00:57:08] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 105 ms.
[2020-05-21 00:57:08] [INFO ] Computed order based on color domains.
[2020-05-21 00:57:08] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 65 ms.
[2020-05-21 00:57:08] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 42 places in 37 ms
Reduce places removed 42 places and 84 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 218 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 535 ms. (steps per millisecond=18 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1]
FORMULA Peterson-COL-6-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 455 ms. (steps per millisecond=21 ) properties seen :[0, 0, 1, 0, 0]
FORMULA Peterson-COL-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 506 ms. (steps per millisecond=19 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0]
[2020-05-21 00:57:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-05-21 00:57:10] [INFO ] Computed 27 place invariants in 97 ms
[2020-05-21 00:57:11] [INFO ] [Real]Absence check using 20 positive place invariants in 122 ms returned sat
[2020-05-21 00:57:11] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 22 ms returned sat
[2020-05-21 00:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 00:57:15] [INFO ] [Real]Absence check using state equation in 4289 ms returned (error "Failed to check-sat")
[2020-05-21 00:57:16] [INFO ] [Real]Absence check using 20 positive place invariants in 143 ms returned sat
[2020-05-21 00:57:16] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 27 ms returned sat
[2020-05-21 00:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 00:57:20] [INFO ] [Real]Absence check using state equation in 4528 ms returned (error "Failed to check-sat")
[2020-05-21 00:57:21] [INFO ] [Real]Absence check using 20 positive place invariants in 79 ms returned sat
[2020-05-21 00:57:21] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 59 ms returned sat
[2020-05-21 00:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 00:57:25] [INFO ] [Real]Absence check using state equation in 4727 ms returned (error "Failed to check-sat")
[2020-05-21 00:57:26] [INFO ] [Real]Absence check using 20 positive place invariants in 64 ms returned sat
[2020-05-21 00:57:26] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 24 ms returned sat
[2020-05-21 00:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:57:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 00:57:30] [INFO ] [Real]Absence check using state equation in 4814 ms returned (error "Failed to check-sat")
Support contains 742 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 216 Post agglomeration using F-continuation condition.Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 1330 transition count 1814
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 1114 transition count 1814
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 432 place count 1114 transition count 1778
Deduced a syphon composed of 36 places in 26 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 504 place count 1078 transition count 1778
Applied a total of 504 rules in 423 ms. Remains 1078 /1330 variables (removed 252) and now considering 1778/2030 (removed 252) transitions.
Finished structural reductions, in 1 iterations. Remains : 1078/1330 places, 1778/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12342 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2502 ms. (steps per millisecond=399 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2509 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 118040 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=23 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 694456 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 6042480 steps, run timeout after 30001 ms. (steps per millisecond=201 ) properties seen :[1, 1, 0, 1]
Probabilistic random walk after 6042480 steps, saw 755311 distinct states, run finished after 30001 ms. (steps per millisecond=201 ) properties seen :[1, 1, 0, 1]
FORMULA Peterson-COL-6-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-05-21 00:58:28] [INFO ] Flow matrix only has 1568 transitions (discarded 210 similar events)
// Phase 1: matrix 1568 rows 1078 cols
[2020-05-21 00:58:28] [INFO ] Computed 27 place invariants in 11 ms
[2020-05-21 00:58:28] [INFO ] [Real]Absence check using 20 positive place invariants in 81 ms returned sat
[2020-05-21 00:58:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 31 ms returned sat
[2020-05-21 00:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:58:35] [INFO ] [Real]Absence check using state equation in 6579 ms returned sat
[2020-05-21 00:58:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:58:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 225 ms returned sat
[2020-05-21 00:58:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 64 ms returned sat
[2020-05-21 00:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:58:43] [INFO ] [Nat]Absence check using state equation in 7061 ms returned sat
[2020-05-21 00:58:43] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 00:58:43] [INFO ] [Nat]Added 366 Read/Feed constraints in 126 ms returned sat
[2020-05-21 00:58:44] [INFO ] Deduced a trap composed of 91 places in 1155 ms
[2020-05-21 00:58:45] [INFO ] Deduced a trap composed of 53 places in 853 ms
[2020-05-21 00:58:46] [INFO ] Deduced a trap composed of 125 places in 1119 ms
[2020-05-21 00:58:47] [INFO ] Deduced a trap composed of 26 places in 747 ms
[2020-05-21 00:58:48] [INFO ] Deduced a trap composed of 20 places in 855 ms
[2020-05-21 00:58:49] [INFO ] Deduced a trap composed of 68 places in 867 ms
[2020-05-21 00:58:50] [INFO ] Deduced a trap composed of 119 places in 855 ms
[2020-05-21 00:58:51] [INFO ] Deduced a trap composed of 73 places in 638 ms
[2020-05-21 00:58:51] [INFO ] Deduced a trap composed of 66 places in 623 ms
[2020-05-21 00:58:52] [INFO ] Deduced a trap composed of 80 places in 678 ms
[2020-05-21 00:58:53] [INFO ] Deduced a trap composed of 71 places in 727 ms
[2020-05-21 00:58:54] [INFO ] Deduced a trap composed of 11 places in 651 ms
[2020-05-21 00:58:55] [INFO ] Deduced a trap composed of 207 places in 674 ms
[2020-05-21 00:58:55] [INFO ] Deduced a trap composed of 23 places in 659 ms
[2020-05-21 00:58:56] [INFO ] Deduced a trap composed of 35 places in 704 ms
[2020-05-21 00:58:57] [INFO ] Deduced a trap composed of 14 places in 747 ms
[2020-05-21 00:58:58] [INFO ] Deduced a trap composed of 174 places in 732 ms
[2020-05-21 00:58:59] [INFO ] Deduced a trap composed of 56 places in 757 ms
[2020-05-21 00:59:00] [INFO ] Deduced a trap composed of 113 places in 757 ms
[2020-05-21 00:59:00] [INFO ] Deduced a trap composed of 29 places in 741 ms
[2020-05-21 00:59:01] [INFO ] Deduced a trap composed of 17 places in 821 ms
[2020-05-21 00:59:02] [INFO ] Deduced a trap composed of 16 places in 789 ms
[2020-05-21 00:59:03] [INFO ] Deduced a trap composed of 20 places in 894 ms
[2020-05-21 00:59:04] [INFO ] Deduced a trap composed of 20 places in 848 ms
[2020-05-21 00:59:05] [INFO ] Deduced a trap composed of 65 places in 804 ms
[2020-05-21 00:59:06] [INFO ] Deduced a trap composed of 59 places in 848 ms
[2020-05-21 00:59:07] [INFO ] Deduced a trap composed of 51 places in 875 ms
[2020-05-21 00:59:08] [INFO ] Deduced a trap composed of 20 places in 887 ms
[2020-05-21 00:59:09] [INFO ] Deduced a trap composed of 47 places in 838 ms
[2020-05-21 00:59:10] [INFO ] Deduced a trap composed of 69 places in 800 ms
[2020-05-21 00:59:11] [INFO ] Deduced a trap composed of 57 places in 921 ms
[2020-05-21 00:59:12] [INFO ] Deduced a trap composed of 47 places in 752 ms
[2020-05-21 00:59:12] [INFO ] Deduced a trap composed of 38 places in 701 ms
[2020-05-21 00:59:13] [INFO ] Deduced a trap composed of 35 places in 778 ms
[2020-05-21 00:59:14] [INFO ] Deduced a trap composed of 37 places in 774 ms
[2020-05-21 00:59:15] [INFO ] Deduced a trap composed of 100 places in 837 ms
[2020-05-21 00:59:16] [INFO ] Deduced a trap composed of 94 places in 775 ms
[2020-05-21 00:59:17] [INFO ] Deduced a trap composed of 92 places in 849 ms
[2020-05-21 00:59:18] [INFO ] Deduced a trap composed of 44 places in 803 ms
[2020-05-21 00:59:19] [INFO ] Deduced a trap composed of 157 places in 769 ms
[2020-05-21 00:59:20] [INFO ] Deduced a trap composed of 114 places in 914 ms
[2020-05-21 00:59:21] [INFO ] Deduced a trap composed of 87 places in 802 ms
[2020-05-21 00:59:21] [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 s9 s15 s21 s24 s25 s26 s27 s28 s29 s45 s49 s50 s54 s63 s64 s65 s66 s68 s69 s78 s79 s80 s81 s83 s85 s86 s87 s89 s90 s107 s108 s109 s110 s111 s112 s129 s132 s133 s134 s137 s149 s150 s151 s152 s153 s155 s189 s195 s197 s199 s205 s227 s228 s229 s230 s231 s232 s252 s253 s254 s257 s267 s271 s288 s289 s295 s296 s302 s303 s309 s310 s544 s550 s556 s562 s568 s574 s676 s694 s700 s706 s724 s798 s805 s812 s819) 0)") while checking expression at index 0
Support contains 476 out of 1078 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1078/1078 places, 1778/1778 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1078 transition count 1742
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 1042 transition count 1742
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 72 place count 1042 transition count 1526
Deduced a syphon composed of 216 places in 2 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 504 place count 826 transition count 1526
Applied a total of 504 rules in 187 ms. Remains 826 /1078 variables (removed 252) and now considering 1526/1778 (removed 252) transitions.
Finished structural reductions, in 1 iterations. Remains : 826/1078 places, 1526/1778 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3541 ms. (steps per millisecond=282 ) properties seen :[0]
Interrupted Best-First random walk after 132504 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=26 ) properties seen :[0]
Interrupted probabilistic random walk after 6982832 steps, run timeout after 30001 ms. (steps per millisecond=232 ) properties seen :[0]
Probabilistic random walk after 6982832 steps, saw 872855 distinct states, run finished after 30001 ms. (steps per millisecond=232 ) properties seen :[0]
[2020-05-21 00:59:59] [INFO ] Flow matrix only has 1316 transitions (discarded 210 similar events)
// Phase 1: matrix 1316 rows 826 cols
[2020-05-21 00:59:59] [INFO ] Computed 27 place invariants in 15 ms
[2020-05-21 01:00:00] [INFO ] [Real]Absence check using 20 positive place invariants in 126 ms returned sat
[2020-05-21 01:00:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 33 ms returned sat
[2020-05-21 01:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:03] [INFO ] [Real]Absence check using state equation in 3497 ms returned sat
[2020-05-21 01:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:00:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 82 ms returned sat
[2020-05-21 01:00:03] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 36 ms returned sat
[2020-05-21 01:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:00:08] [INFO ] [Nat]Absence check using state equation in 4497 ms returned sat
[2020-05-21 01:00:08] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-05-21 01:00:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 131 ms returned sat
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 19 places in 513 ms
[2020-05-21 01:00:09] [INFO ] Deduced a trap composed of 48 places in 573 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 27 places in 547 ms
[2020-05-21 01:00:10] [INFO ] Deduced a trap composed of 87 places in 475 ms
[2020-05-21 01:00:11] [INFO ] Deduced a trap composed of 29 places in 501 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 129 places in 623 ms
[2020-05-21 01:00:12] [INFO ] Deduced a trap composed of 148 places in 594 ms
[2020-05-21 01:00:13] [INFO ] Deduced a trap composed of 19 places in 517 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 35 places in 506 ms
[2020-05-21 01:00:14] [INFO ] Deduced a trap composed of 29 places in 488 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 17 places in 582 ms
[2020-05-21 01:00:15] [INFO ] Deduced a trap composed of 44 places in 488 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 49 places in 502 ms
[2020-05-21 01:00:16] [INFO ] Deduced a trap composed of 29 places in 483 ms
[2020-05-21 01:00:17] [INFO ] Deduced a trap composed of 11 places in 488 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 123 places in 488 ms
[2020-05-21 01:00:18] [INFO ] Deduced a trap composed of 76 places in 487 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 125 places in 485 ms
[2020-05-21 01:00:19] [INFO ] Deduced a trap composed of 53 places in 463 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 53 places in 475 ms
[2020-05-21 01:00:20] [INFO ] Deduced a trap composed of 57 places in 424 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 51 places in 474 ms
[2020-05-21 01:00:21] [INFO ] Deduced a trap composed of 28 places in 478 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 80 places in 504 ms
[2020-05-21 01:00:22] [INFO ] Deduced a trap composed of 23 places in 471 ms
[2020-05-21 01:00:23] [INFO ] Deduced a trap composed of 90 places in 567 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 20 places in 382 ms
[2020-05-21 01:00:24] [INFO ] Deduced a trap composed of 75 places in 505 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 17 places in 375 ms
[2020-05-21 01:00:25] [INFO ] Deduced a trap composed of 98 places in 473 ms
[2020-05-21 01:00:26] [INFO ] Deduced a trap composed of 65 places in 431 ms
[2020-05-21 01:00:26] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 17643 ms
[2020-05-21 01:00:26] [INFO ] Computed and/alt/rep : 1519/8372/1309 causal constraints in 89 ms.
[2020-05-21 01:00:46] [INFO ] Added : 625 causal constraints over 125 iterations in 20256 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 105 ms.
Finished Parikh walk after 61523 steps, including 367 resets, run visited all 1 properties in 362 ms. (steps per millisecond=169 )
FORMULA Peterson-COL-6-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590022847513

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="Peterson-COL-6"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-COL-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258000695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;