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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.540 46971.00 65598.00 93.10 FTFTTFFTTFTFFTTF 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-158961258000671.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-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 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 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.7K 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 43K 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-3-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590019105592

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

[2020-05-20 23:58:28] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 34 ms.
[2020-05-20 23:58:28] [INFO ] Computed order based on color domains.
[2020-05-20 23:58:28] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 33 ms.
[2020-05-20 23:58:28] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 71 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 177 ms. (steps per millisecond=56 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0]
FORMULA Peterson-COL-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 137 ms. (steps per millisecond=72 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-05-20 23:58:29] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-20 23:58:29] [INFO ] Computed 15 place invariants in 12 ms
[2020-05-20 23:58:29] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-05-20 23:58:29] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:29] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-05-20 23:58:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-20 23:58:30] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-20 23:58:30] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 28 ms.
[2020-05-20 23:58:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-05-20 23:58:30] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:30] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2020-05-20 23:58:30] [INFO ] [Nat]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 16 places in 138 ms
[2020-05-20 23:58:30] [INFO ] Deduced a trap composed of 17 places in 110 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 20 places in 114 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 54 places in 91 ms
[2020-05-20 23:58:31] [INFO ] Deduced a trap composed of 57 places in 75 ms
[2020-05-20 23:58:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 990 ms
[2020-05-20 23:58:31] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 32 ms.
[2020-05-20 23:58:33] [INFO ] Added : 304 causal constraints over 61 iterations in 1860 ms. Result :sat
[2020-05-20 23:58:33] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2020-05-20 23:58:33] [INFO ] Deduced a trap composed of 57 places in 68 ms
[2020-05-20 23:58:33] [INFO ] Deduced a trap composed of 59 places in 100 ms
[2020-05-20 23:58:33] [INFO ] Deduced a trap composed of 49 places in 103 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 50 places in 81 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 41 places in 48 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 73 places in 142 ms
[2020-05-20 23:58:34] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2020-05-20 23:58:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1013 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-20 23:58:34] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-05-20 23:58:34] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:34] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2020-05-20 23:58:35] [INFO ] [Real]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-05-20 23:58:35] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-05-20 23:58:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-20 23:58:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:35] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2020-05-20 23:58:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 16 places in 132 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-05-20 23:58:35] [INFO ] Deduced a trap composed of 35 places in 133 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 20 places in 225 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 34 places in 85 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 54 places in 82 ms
[2020-05-20 23:58:36] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-05-20 23:58:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1059 ms
[2020-05-20 23:58:36] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-20 23:58:38] [INFO ] Added : 304 causal constraints over 61 iterations in 1833 ms. Result :sat
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 57 places in 85 ms
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 59 places in 87 ms
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 49 places in 88 ms
[2020-05-20 23:58:38] [INFO ] Deduced a trap composed of 50 places in 88 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 41 places in 113 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 73 places in 79 ms
[2020-05-20 23:58:39] [INFO ] Deduced a trap composed of 26 places in 128 ms
[2020-05-20 23:58:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1031 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-20 23:58:39] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-20 23:58:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:39] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-05-20 23:58:39] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:58:39] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-20 23:58:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:40] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2020-05-20 23:58:40] [INFO ] [Nat]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2020-05-20 23:58:40] [INFO ] Deduced a trap composed of 35 places in 138 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 20 places in 151 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 34 places in 112 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 54 places in 122 ms
[2020-05-20 23:58:41] [INFO ] Deduced a trap composed of 57 places in 86 ms
[2020-05-20 23:58:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1136 ms
[2020-05-20 23:58:41] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-20 23:58:43] [INFO ] Added : 304 causal constraints over 61 iterations in 1868 ms. Result :sat
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 36 places in 83 ms
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 57 places in 131 ms
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 59 places in 68 ms
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 49 places in 89 ms
[2020-05-20 23:58:43] [INFO ] Deduced a trap composed of 50 places in 99 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 73 places in 111 ms
[2020-05-20 23:58:44] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-05-20 23:58:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1098 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-05-20 23:58:44] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-20 23:58:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:44] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-05-20 23:58:44] [INFO ] [Real]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-20 23:58:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-05-20 23:58:45] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:45] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-05-20 23:58:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-05-20 23:58:45] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2020-05-20 23:58:45] [INFO ] Deduced a trap composed of 9 places in 168 ms
[2020-05-20 23:58:45] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 16 places in 126 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 40 places in 112 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 56 places in 99 ms
[2020-05-20 23:58:46] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2020-05-20 23:58:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1394 ms
[2020-05-20 23:58:46] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-20 23:58:48] [INFO ] Added : 299 causal constraints over 60 iterations in 1929 ms. Result :sat
[2020-05-20 23:58:48] [INFO ] Deduced a trap composed of 39 places in 94 ms
[2020-05-20 23:58:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-20 23:58:49] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:49] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-05-20 23:58:49] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 29 ms.
[2020-05-20 23:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:49] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2020-05-20 23:58:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 17 places in 111 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 20 places in 99 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 34 places in 97 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 54 places in 101 ms
[2020-05-20 23:58:50] [INFO ] Deduced a trap composed of 57 places in 79 ms
[2020-05-20 23:58:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 990 ms
[2020-05-20 23:58:50] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-05-20 23:58:52] [INFO ] Added : 304 causal constraints over 61 iterations in 1592 ms. Result :sat
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 36 places in 69 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 59 places in 100 ms
[2020-05-20 23:58:52] [INFO ] Deduced a trap composed of 49 places in 102 ms
[2020-05-20 23:58:53] [INFO ] Deduced a trap composed of 50 places in 85 ms
[2020-05-20 23:58:53] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-05-20 23:58:53] [INFO ] Deduced a trap composed of 73 places in 126 ms
[2020-05-20 23:58:53] [INFO ] Deduced a trap composed of 26 places in 126 ms
[2020-05-20 23:58:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1120 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-20 23:58:53] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-20 23:58:53] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 23:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:54] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Real]Added 66 Read/Feed constraints in 28 ms returned sat
[2020-05-20 23:58:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 51 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:54] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2020-05-20 23:58:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 26 ms returned sat
[2020-05-20 23:58:54] [INFO ] Deduced a trap composed of 31 places in 125 ms
[2020-05-20 23:58:54] [INFO ] Deduced a trap composed of 16 places in 114 ms
[2020-05-20 23:58:54] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 13 places in 94 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 45 places in 102 ms
[2020-05-20 23:58:55] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2020-05-20 23:58:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 742 ms
[2020-05-20 23:58:55] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-05-20 23:58:56] [INFO ] Added : 302 causal constraints over 61 iterations in 1571 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-20 23:58:56] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:57] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-05-20 23:58:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:58:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:58:57] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-05-20 23:58:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-05-20 23:58:57] [INFO ] Deduced a trap composed of 59 places in 112 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 32 places in 65 ms
[2020-05-20 23:58:58] [INFO ] Deduced a trap composed of 49 places in 85 ms
[2020-05-20 23:58:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 671 ms
[2020-05-20 23:58:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-20 23:59:00] [INFO ] Added : 279 causal constraints over 56 iterations in 1624 ms. Result :sat
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 38 places in 110 ms
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 49 places in 106 ms
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 84 places in 128 ms
[2020-05-20 23:59:00] [INFO ] Deduced a trap composed of 17 places in 110 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 16 places in 108 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 41 places in 70 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 15 places in 110 ms
[2020-05-20 23:59:01] [INFO ] Deduced a trap composed of 12 places in 130 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 49 places in 122 ms
[2020-05-20 23:59:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 23:59:02] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-05-20 23:59:02] [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 (> (+ s32 s33 s34 s35) 0)") while checking expression at index 6
Incomplete Parikh walk after 79100 steps, including 937 resets, run finished after 388 ms. (steps per millisecond=203 ) properties seen :[1, 1, 1, 0, 1, 1, 1] could not realise parikh vector
FORMULA Peterson-COL-3-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 95400 steps, including 817 resets, run finished after 329 ms. (steps per millisecond=289 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 70200 steps, including 928 resets, run finished after 202 ms. (steps per millisecond=347 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 814 resets, run finished after 276 ms. (steps per millisecond=345 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 817 resets, run finished after 275 ms. (steps per millisecond=346 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 813 resets, run finished after 283 ms. (steps per millisecond=337 ) properties seen :[0] could not realise parikh vector
Support contains 68 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 108 place count 190 transition count 235
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 194 place count 147 transition count 235
Applied a total of 194 rules in 64 ms. Remains 147 /244 variables (removed 97) and now considering 235/332 (removed 97) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/244 places, 235/332 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2536 ms. (steps per millisecond=394 ) properties seen :[0]
Interrupted Best-First random walk after 989625 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0]
Finished probabilistic random walk after 187595 steps, run visited all 1 properties in 336 ms. (steps per millisecond=558 )
Probabilistic random walk after 187595 steps, saw 37520 distinct states, run finished after 336 ms. (steps per millisecond=558 ) properties seen :[1]
FORMULA Peterson-COL-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590019152563

--------------------
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-3"
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-3, 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-158961258000671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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