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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.480 3600000.00 55989.00 102.70 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.r174-csrt-158987853500671.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 itslola
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 r174-csrt-158987853500671
=====================================================================

--------------------
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 1591162632894

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:37:15] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:37:15] [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-06-03 05:37:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 719 ms
[2020-06-03 05:37:16] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:37:16] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 63 ms.
[2020-06-03 05:37:16] [INFO ] Computed order based on color domains.
[2020-06-03 05:37:16] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 27 ms.
[2020-06-03 05:37:16] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 88 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 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=104 ) 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 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 125 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:37:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:37:17] [INFO ] Computed 15 place invariants in 27 ms
[2020-06-03 05:37:17] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-06-03 05:37:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:17] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2020-06-03 05:37:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:37:18] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:18] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 27 ms.
[2020-06-03 05:37:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:18] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 34 ms returned sat
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 16 places in 181 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 17 places in 153 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 20 places in 286 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 34 places in 287 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 54 places in 145 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 57 places in 85 ms
[2020-06-03 05:37:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1662 ms
[2020-06-03 05:37:20] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-06-03 05:37:22] [INFO ] Added : 304 causal constraints over 61 iterations in 1839 ms. Result :sat
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 57 places in 97 ms
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 59 places in 97 ms
[2020-06-03 05:37:23] [INFO ] Deduced a trap composed of 49 places in 158 ms
[2020-06-03 05:37:23] [INFO ] Deduced a trap composed of 50 places in 255 ms
[2020-06-03 05:37:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s6 s10 s15 s16 s21 s22 s28 s30 s31 s39 s40 s45 s60 s61 s62 s63 s64 s65 s66 s67 s84 s85 s99 s105 s124 s125 s126 s127 s128 s129 s130 s131 s148 s149 s169 s170 s171 s172 s173 s174 s187 s188 s208 s209 s210 s211 s212 s213 s214 s232) 0)") while checking expression at index 0
[2020-06-03 05:37:23] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:37:23] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:23] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-06-03 05:37:23] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 29 ms.
[2020-06-03 05:37:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:37:23] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2020-06-03 05:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:24] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-06-03 05:37:24] [INFO ] [Nat]Added 66 Read/Feed constraints in 37 ms returned sat
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 16 places in 212 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 17 places in 459 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 35 places in 91 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 34 places in 104 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 54 places in 72 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 57 places in 53 ms
[2020-06-03 05:37:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1376 ms
[2020-06-03 05:37:25] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-06-03 05:37:26] [INFO ] Added : 304 causal constraints over 61 iterations in 1349 ms. Result :sat
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 57 places in 178 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 59 places in 98 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 49 places in 94 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 50 places in 196 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 73 places in 100 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2020-06-03 05:37:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1258 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:37:28] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 52 ms.
[2020-06-03 05:37:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 32 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:29] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2020-06-03 05:37:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 35 places in 159 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2020-06-03 05:37:30] [INFO ] Deduced a trap composed of 34 places in 89 ms
[2020-06-03 05:37:30] [INFO ] Deduced a trap composed of 54 places in 182 ms
[2020-06-03 05:37:30] [INFO ] Deduced a trap composed of 57 places in 79 ms
[2020-06-03 05:37:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1085 ms
[2020-06-03 05:37:30] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 38 ms.
[2020-06-03 05:37:31] [INFO ] Added : 304 causal constraints over 61 iterations in 1537 ms. Result :sat
[2020-06-03 05:37:31] [INFO ] Deduced a trap composed of 36 places in 80 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 57 places in 59 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 59 places in 68 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 49 places in 57 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 50 places in 56 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 73 places in 73 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 26 places in 96 ms
[2020-06-03 05:37:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 816 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 05:37:32] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2020-06-03 05:37:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:33] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-06-03 05:37:33] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:37:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:37:33] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:33] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-03 05:37:33] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 9 places in 139 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 22 places in 107 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 40 places in 113 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 38 places in 30 ms
[2020-06-03 05:37:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1372 ms
[2020-06-03 05:37:35] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:37:36] [INFO ] Added : 299 causal constraints over 60 iterations in 1594 ms. Result :sat
[2020-06-03 05:37:36] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-06-03 05:37:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 05:37:36] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:37:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:37] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2020-06-03 05:37:37] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:37:37] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-06-03 05:37:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:37:37] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:37] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-03 05:37:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:37:37] [INFO ] Deduced a trap composed of 16 places in 138 ms
[2020-06-03 05:37:37] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 20 places in 105 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 35 places in 102 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 34 places in 95 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 54 places in 111 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 57 places in 87 ms
[2020-06-03 05:37:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 973 ms
[2020-06-03 05:37:38] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-06-03 05:37:40] [INFO ] Added : 304 causal constraints over 61 iterations in 1491 ms. Result :sat
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 36 places in 56 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 57 places in 156 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 59 places in 67 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 49 places in 113 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 50 places in 98 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 41 places in 74 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 73 places in 102 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 26 places in 93 ms
[2020-06-03 05:37:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1072 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-06-03 05:37:41] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:37:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:37:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:41] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2020-06-03 05:37:41] [INFO ] [Real]Added 66 Read/Feed constraints in 28 ms returned sat
[2020-06-03 05:37:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 05:37:41] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:37:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:42] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2020-06-03 05:37:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 26 places in 116 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 13 places in 66 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 45 places in 88 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 45 places in 50 ms
[2020-06-03 05:37:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 621 ms
[2020-06-03 05:37:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 69 ms.
[2020-06-03 05:37:44] [INFO ] Added : 302 causal constraints over 61 iterations in 1570 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 05:37:44] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-06-03 05:37:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:44] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-06-03 05:37:44] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:37:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:37:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:45] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-06-03 05:37:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 59 places in 106 ms
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 32 places in 69 ms
[2020-06-03 05:37:45] [INFO ] Deduced a trap composed of 49 places in 83 ms
[2020-06-03 05:37:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 620 ms
[2020-06-03 05:37:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-06-03 05:37:47] [INFO ] Added : 279 causal constraints over 56 iterations in 1364 ms. Result :sat
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 32 places in 81 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 26 places in 114 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 49 places in 90 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 84 places in 95 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 17 places in 68 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 16 places in 78 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 34 places in 99 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-06-03 05:37:48] [INFO ] Deduced a trap composed of 49 places in 102 ms
[2020-06-03 05:37:49] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-06-03 05:37:49] [INFO ] Deduced a trap composed of 55 places in 59 ms
[2020-06-03 05:37:49] [INFO ] Deduced a trap composed of 61 places in 96 ms
[2020-06-03 05:37:49] [INFO ] Deduced a trap composed of 63 places in 71 ms
[2020-06-03 05:37:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2374 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 85000 steps, including 937 resets, run finished after 566 ms. (steps per millisecond=150 ) 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
Finished Parikh walk after 61193 steps, including 802 resets, run visited all 1 properties in 232 ms. (steps per millisecond=263 )
FORMULA Peterson-COL-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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="itslola"
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 itslola"
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 r174-csrt-158987853500671"
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 ;