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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.550 3600000.00 34331.00 97.50 TTTTFFFTFTFTFFTF 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-158987853500663.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-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 42K 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-2-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-2-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591162492565

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

[2020-06-03 05:34:55] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 45 ms.
[2020-06-03 05:34:55] [INFO ] Computed order based on color domains.
[2020-06-03 05:34:55] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 19 ms.
[2020-06-03 05:34:55] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 137 ms. (steps per millisecond=72 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-COL-2-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:34:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2020-06-03 05:34:56] [INFO ] Computed 11 place invariants in 9 ms
[2020-06-03 05:34:56] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2020-06-03 05:34:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:56] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-06-03 05:34:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-03 05:34:56] [INFO ] [Real]Added 26 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:34:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-03 05:34:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:56] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 05:34:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 15 places in 107 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2020-06-03 05:34:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2020-06-03 05:34:57] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 9 ms.
[2020-06-03 05:34:57] [INFO ] Added : 85 causal constraints over 17 iterations in 202 ms. Result :sat
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 24 places in 28 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 34 places in 33 ms
[2020-06-03 05:34:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 05:34:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:57] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Real]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:34:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:57] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-06-03 05:34:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-03 05:34:57] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 10 places in 29 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2020-06-03 05:34:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 227 ms
[2020-06-03 05:34:58] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:34:58] [INFO ] Added : 96 causal constraints over 20 iterations in 237 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-03 05:34:58] [INFO ] [Real]Absence check using 8 positive place invariants in 71 ms returned unsat
[2020-06-03 05:34:58] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:58] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 31 places in 58 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 50 places in 45 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 12 places in 21 ms
[2020-06-03 05:34:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2020-06-03 05:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:58] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-03 05:34:58] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 12 places in 38 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 15 places in 33 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 43 places in 24 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 37 places in 24 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-06-03 05:34:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 361 ms
[2020-06-03 05:34:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:34:59] [INFO ] Added : 102 causal constraints over 21 iterations in 185 ms. Result :sat
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2020-06-03 05:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-03 05:34:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:59] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:34:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-03 05:34:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 22 places in 45 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 14 places in 27 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 37 places in 26 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-06-03 05:35:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 276 ms
[2020-06-03 05:35:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 13 ms.
[2020-06-03 05:35:00] [INFO ] Added : 81 causal constraints over 17 iterations in 204 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-03 05:35:00] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 9 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:00] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:35:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:00] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 26 places in 40 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 15 places in 22 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 13 places in 24 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-06-03 05:35:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 195 ms
[2020-06-03 05:35:00] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:35:00] [INFO ] Added : 114 causal constraints over 23 iterations in 242 ms. Result :sat
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 29 places in 19 ms
[2020-06-03 05:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 05:35:00] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:01] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2020-06-03 05:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2020-06-03 05:35:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 42 places in 35 ms
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2020-06-03 05:35:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 231 ms
[2020-06-03 05:35:01] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:35:01] [INFO ] Added : 104 causal constraints over 21 iterations in 257 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 05:35:01] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:35:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 05:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:02] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2020-06-03 05:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2020-06-03 05:35:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2020-06-03 05:35:02] [INFO ] Added : 114 causal constraints over 23 iterations in 257 ms. Result :sat
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 29 places in 33 ms
[2020-06-03 05:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-03 05:35:02] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:02] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-06-03 05:35:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:02] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2020-06-03 05:35:02] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 11 places in 32 ms
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 25 places in 27 ms
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 26 places in 44 ms
[2020-06-03 05:35:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2020-06-03 05:35:02] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2020-06-03 05:35:03] [INFO ] Added : 117 causal constraints over 24 iterations in 291 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned unsat
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 35 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:35:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:03] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-03 05:35:03] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 31 places in 38 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 25 places in 27 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-03 05:35:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 221 ms
[2020-06-03 05:35:03] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 6 ms.
[2020-06-03 05:35:03] [INFO ] Added : 117 causal constraints over 24 iterations in 284 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-03 05:35:03] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned unsat
FORMULA Peterson-COL-2-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-2-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 21100 steps, including 329 resets, run finished after 183 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA Peterson-COL-2-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24100 steps, including 365 resets, run finished after 103 ms. (steps per millisecond=233 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 1] could not realise parikh vector
FORMULA Peterson-COL-2-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21400 steps, including 467 resets, run finished after 102 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 25400 steps, including 385 resets, run finished after 64 ms. (steps per millisecond=396 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 21500 steps, including 394 resets, run finished after 70 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 15300 steps, including 632 resets, run finished after 53 ms. (steps per millisecond=288 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 26000 steps, including 492 resets, run finished after 79 ms. (steps per millisecond=329 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 22000 steps, including 371 resets, run finished after 52 ms. (steps per millisecond=423 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 18300 steps, including 582 resets, run finished after 39 ms. (steps per millisecond=469 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 69 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 98 transition count 122
Applied a total of 8 rules in 50 ms. Remains 98 /102 variables (removed 4) and now considering 122/126 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/102 places, 122/126 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1472 ms. (steps per millisecond=679 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1152 ms. (steps per millisecond=868 ) properties seen :[0, 0, 0]
Finished probabilistic random walk after 35116 steps, run visited all 3 properties in 87 ms. (steps per millisecond=403 )
Probabilistic random walk after 35116 steps, saw 8780 distinct states, run finished after 87 ms. (steps per millisecond=403 ) properties seen :[1, 1, 1]
FORMULA Peterson-COL-2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-2-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-2"
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-2, 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-158987853500663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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