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-158961258000678.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-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 44K 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-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590019150239

[2020-05-20 23:59:12] [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-20 23:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 23:59:12] [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-20 23:59:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 939 ms
[2020-05-20 23:59:13] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-05-20 23:59:13] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 107 ms.
[2020-05-20 23:59:13] [INFO ] Computed order based on color domains.
[2020-05-20 23:59:13] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 43 ms.
[2020-05-20 23:59:13] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=47 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0]
FORMULA Peterson-COL-4-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
[2020-05-20 23:59:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-05-20 23:59:14] [INFO ] Computed 19 place invariants in 33 ms
[2020-05-20 23:59:14] [INFO ] [Real]Absence check using 14 positive place invariants in 43 ms returned unsat
[2020-05-20 23:59:15] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned unsat
[2020-05-20 23:59:15] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned unsat
[2020-05-20 23:59:15] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2020-05-20 23:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:16] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2020-05-20 23:59:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-20 23:59:16] [INFO ] [Real]Added 132 Read/Feed constraints in 80 ms returned sat
[2020-05-20 23:59:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 82 ms returned sat
[2020-05-20 23:59:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-05-20 23:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:17] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2020-05-20 23:59:17] [INFO ] [Nat]Added 132 Read/Feed constraints in 40 ms returned sat
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 79 places in 382 ms
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 25 places in 244 ms
[2020-05-20 23:59:18] [INFO ] Deduced a trap composed of 18 places in 245 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 10 places in 248 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 31 places in 286 ms
[2020-05-20 23:59:19] [INFO ] Deduced a trap composed of 18 places in 265 ms
[2020-05-20 23:59:20] [INFO ] Deduced a trap composed of 19 places in 269 ms
[2020-05-20 23:59:20] [INFO ] Deduced a trap composed of 77 places in 415 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 20 places in 355 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 77 places in 390 ms
[2020-05-20 23:59:21] [INFO ] Deduced a trap composed of 82 places in 231 ms
[2020-05-20 23: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 s19 s23 s24 s25 s26 s32 s33 s34 s35 s36 s38 s50 s52 s53 s54 s62 s63 s64 s65 s71 s72 s73 s110 s111 s112 s115 s116 s120 s121 s125 s126 s155 s156 s160 s161 s165 s166 s183 s184 s185 s191 s192 s193 s235 s236 s237 s240 s241 s245 s246 s250 s251 s280 s281 s285 s286 s290 s291 s328 s329 s332 s333 s336 s337 s340 s341 s364 s365 s368 s369 s372 s373 s415 s416 s420 s425 s430 s460 s465 s470) 0)") while checking expression at index 3
[2020-05-20 23:59:21] [INFO ] [Real]Absence check using 14 positive place invariants in 37 ms returned sat
[2020-05-20 23:59:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-05-20 23:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:22] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2020-05-20 23:59:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned unsat
[2020-05-20 23:59:23] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-20 23:59:23] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 15 ms returned sat
[2020-05-20 23:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:24] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2020-05-20 23:59:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-05-20 23:59:24] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2020-05-20 23:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:24] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2020-05-20 23:59:25] [INFO ] [Nat]Added 132 Read/Feed constraints in 42 ms returned sat
[2020-05-20 23:59:25] [INFO ] Deduced a trap composed of 38 places in 666 ms
[2020-05-20 23:59:26] [INFO ] Deduced a trap composed of 36 places in 272 ms
[2020-05-20 23:59:26] [INFO ] Deduced a trap composed of 26 places in 213 ms
[2020-05-20 23:59:26] [INFO ] Deduced a trap composed of 80 places in 286 ms
[2020-05-20 23:59:26] [INFO ] Deduced a trap composed of 18 places in 215 ms
[2020-05-20 23:59:27] [INFO ] Deduced a trap composed of 22 places in 223 ms
[2020-05-20 23:59:27] [INFO ] Deduced a trap composed of 79 places in 233 ms
[2020-05-20 23:59:27] [INFO ] Deduced a trap composed of 25 places in 221 ms
[2020-05-20 23:59:27] [INFO ] Deduced a trap composed of 96 places in 228 ms
[2020-05-20 23:59:28] [INFO ] Deduced a trap composed of 21 places in 209 ms
[2020-05-20 23:59:28] [INFO ] Deduced a trap composed of 80 places in 217 ms
[2020-05-20 23:59:28] [INFO ] Deduced a trap composed of 85 places in 245 ms
[2020-05-20 23:59:28] [INFO ] Deduced a trap composed of 38 places in 232 ms
[2020-05-20 23:59:29] [INFO ] Deduced a trap composed of 61 places in 280 ms
[2020-05-20 23:59:29] [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 (> (+ s9 s23 s24 s25 s45 s47 s48 s49 s61 s63 s64 s105 s106 s107 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s183 s184 s230 s231 s232 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s324 s325 s332 s333 s334 s335 s336 s337 s338 s339 s410 s411 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429) 0)") while checking expression at index 5
FORMULA Peterson-COL-4-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 145 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 480 transition count 530
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 320 place count 320 transition count 510
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 360 place count 300 transition count 510
Applied a total of 360 rules in 143 ms. Remains 300 /480 variables (removed 180) and now considering 510/690 (removed 180) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/480 places, 510/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2994 ms. (steps per millisecond=334 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1520 ms. (steps per millisecond=657 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1686 ms. (steps per millisecond=593 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 12318102 steps, run timeout after 30001 ms. (steps per millisecond=410 ) properties seen :[0, 0]
Probabilistic random walk after 12318102 steps, saw 2053018 distinct states, run finished after 30001 ms. (steps per millisecond=410 ) properties seen :[0, 0]
[2020-05-21 00:00:05] [INFO ] Flow matrix only has 450 transitions (discarded 60 similar events)
// Phase 1: matrix 450 rows 300 cols
[2020-05-21 00:00:05] [INFO ] Computed 19 place invariants in 4 ms
[2020-05-21 00:00:05] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 00:00:05] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-05-21 00:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:06] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2020-05-21 00:00:06] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 00:00:06] [INFO ] [Real]Added 132 Read/Feed constraints in 54 ms returned sat
[2020-05-21 00:00:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 00:00:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-05-21 00:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:06] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2020-05-21 00:00:06] [INFO ] [Nat]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 49 places in 131 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 40 places in 131 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 47 places in 125 ms
[2020-05-21 00:00:07] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 40 places in 109 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 40 places in 102 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 36 places in 133 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 44 places in 89 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 10 places in 123 ms
[2020-05-21 00:00:08] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 22 places in 101 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 63 places in 110 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 61 places in 86 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 57 places in 110 ms
[2020-05-21 00:00:09] [INFO ] Deduced a trap composed of 54 places in 105 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 48 places in 131 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 12 places in 113 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 67 places in 167 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 30 places in 143 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 85 places in 190 ms
[2020-05-21 00:00:10] [INFO ] Deduced a trap composed of 71 places in 131 ms
[2020-05-21 00:00:11] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2020-05-21 00:00:11] [INFO ] Deduced a trap composed of 21 places in 111 ms
[2020-05-21 00:00:11] [INFO ] Deduced a trap composed of 40 places in 144 ms
[2020-05-21 00:00:11] [INFO ] Deduced a trap composed of 29 places in 125 ms
[2020-05-21 00:00:11] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 12 places in 121 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 49 places in 118 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 48 places in 111 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 12 places in 142 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 40 places in 102 ms
[2020-05-21 00:00:12] [INFO ] Deduced a trap composed of 32 places in 106 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 10 places in 141 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 27 places in 131 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 49 places in 139 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 53 places in 135 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 53 places in 118 ms
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-21 00:00:14] [INFO ] Deduced a trap composed of 60 places in 151 ms
[2020-05-21 00:00:14] [INFO ] Deduced a trap composed of 51 places in 152 ms
[2020-05-21 00:00:14] [INFO ] Deduced a trap composed of 51 places in 125 ms
[2020-05-21 00:00:14] [INFO ] Deduced a trap composed of 61 places in 167 ms
[2020-05-21 00:00:15] [INFO ] Deduced a trap composed of 82 places in 161 ms
[2020-05-21 00:00:15] [INFO ] Deduced a trap composed of 77 places in 133 ms
[2020-05-21 00:00:17] [INFO ] Deduced a trap composed of 47 places in 99 ms
[2020-05-21 00:00:17] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-05-21 00:00:19] [INFO ] Deduced a trap composed of 61 places in 135 ms
[2020-05-21 00:00:19] [INFO ] Deduced a trap composed of 51 places in 114 ms
[2020-05-21 00:00:20] [INFO ] Deduced a trap composed of 97 places in 128 ms
[2020-05-21 00:00:20] [INFO ] Deduced a trap composed of 83 places in 127 ms
[2020-05-21 00:00:20] [INFO ] Deduced a trap composed of 42 places in 130 ms
[2020-05-21 00:00:20] [INFO ] Deduced a trap composed of 42 places in 97 ms
[2020-05-21 00:00:21] [INFO ] Deduced a trap composed of 38 places in 118 ms
[2020-05-21 00:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 59 trap constraints in 14815 ms
[2020-05-21 00:00:21] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 00:00:21] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2020-05-21 00:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:22] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2020-05-21 00:00:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-21 00:00:22] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-21 00:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:22] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2020-05-21 00:00:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 25 ms returned sat
[2020-05-21 00:00:22] [INFO ] Deduced a trap composed of 10 places in 149 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 54 places in 124 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 51 places in 123 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 28 places in 138 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 51 places in 128 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-05-21 00:00:23] [INFO ] Deduced a trap composed of 47 places in 129 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 53 places in 131 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 62 places in 166 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 10 places in 150 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 20 places in 149 ms
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 55 places in 125 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 18 places in 129 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 10 places in 125 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 51 places in 151 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 12 places in 134 ms
[2020-05-21 00:00:25] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-05-21 00:00:26] [INFO ] Deduced a trap composed of 39 places in 119 ms
[2020-05-21 00:00:26] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-05-21 00:00:26] [INFO ] Deduced a trap composed of 75 places in 127 ms
[2020-05-21 00:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 3610 ms
FORMULA Peterson-COL-4-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1590019226709

--------------------
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="Peterson-COL-4"
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 Peterson-COL-4, 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 r111-csrt-158961258000678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;