About the Execution of 2020-gold for Peterson-COL-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
278.632 | 3600000.00 | 36498.00 | 293.20 | TFTTTTTTTTFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151400284.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
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 r151-tall-162089151400284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K May 5 16:51 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 1621019738095
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 19:15:39] [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]
[2021-05-14 19:15:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:15:39] [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.
[2021-05-14 19:15:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2021-05-14 19:15:40] [INFO ] sort/places :
ProcTourProc->BeginLoop,TestIdentity,TestAlone,IsEndLoop,
ProcBool->WantSection,
TourProc->Turn,
ProcTour->AskForSection,TestTurn,EndTurn,
Process->Idle,CS,
[2021-05-14 19:15:40] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 22 ms.
[2021-05-14 19:15:40] [INFO ] Computed order based on color domains.
[2021-05-14 19:15:40] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 20 ms.
[2021-05-14 19:15:40] [INFO ] Unfolded HLPN properties in 0 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 57 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 189 ms. (steps per millisecond=52 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0]
FORMULA Peterson-COL-3-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-05 TRUE 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 76 ms. (steps per millisecond=131 ) properties seen :[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]
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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[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]
[2021-05-14 19:15:41] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:15:41] [INFO ] Computed 15 place invariants in 11 ms
[2021-05-14 19:15:41] [INFO ] [Real]Absence check using 11 positive place invariants in 114 ms returned unsat
[2021-05-14 19:15:41] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-14 19:15:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:41] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-05-14 19:15:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:15:41] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:41] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2021-05-14 19:15:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-14 19:15:41] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:42] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2021-05-14 19:15:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 16 places in 119 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 54 places in 70 ms
[2021-05-14 19:15:42] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2021-05-14 19:15:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 809 ms
[2021-05-14 19:15:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 20 ms.
[2021-05-14 19:15:44] [INFO ] Added : 304 causal constraints over 61 iterations in 1140 ms. Result :sat
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 57 places in 49 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 59 places in 45 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 49 places in 66 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 50 places in 49 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 41 places in 37 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2021-05-14 19:15:44] [INFO ] Deduced a trap composed of 26 places in 60 ms
[2021-05-14 19:15:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 634 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-14 19:15:44] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-14 19:15:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:44] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-14 19:15:44] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:44] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 21 ms.
[2021-05-14 19:15:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-14 19:15:45] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:45] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-14 19:15:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 20 places in 77 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 20 places in 80 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 54 places in 69 ms
[2021-05-14 19:15:45] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2021-05-14 19:15:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 706 ms
[2021-05-14 19:15:46] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2021-05-14 19:15:47] [INFO ] Added : 304 causal constraints over 61 iterations in 1116 ms. Result :sat
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 36 places in 38 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 57 places in 48 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 59 places in 50 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 49 places in 45 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 50 places in 48 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 41 places in 35 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 73 places in 60 ms
[2021-05-14 19:15:47] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2021-05-14 19:15:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 578 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 19:15:47] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:15:47] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:48] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-14 19:15:48] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-14 19:15:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:48] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2021-05-14 19:15:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 61 places in 77 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 50 places in 81 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 49 places in 81 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 20 places in 63 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 51 places in 73 ms
[2021-05-14 19:15:48] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-14 19:15:49] [INFO ] Deduced a trap composed of 52 places in 50 ms
[2021-05-14 19:15:49] [INFO ] Deduced a trap composed of 16 places in 64 ms
[2021-05-14 19:15:49] [INFO ] Deduced a trap composed of 34 places in 54 ms
[2021-05-14 19:15:49] [INFO ] Deduced a trap composed of 37 places in 62 ms
[2021-05-14 19:15:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 875 ms
[2021-05-14 19:15:49] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2021-05-14 19:15:50] [INFO ] Added : 304 causal constraints over 61 iterations in 1227 ms. Result :sat
[2021-05-14 19:15:50] [INFO ] Deduced a trap composed of 34 places in 63 ms
[2021-05-14 19:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 19:15:50] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-14 19:15:50] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:50] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-14 19:15:50] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:15:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-14 19:15:50] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:51] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2021-05-14 19:15:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 56 places in 68 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 17 places in 68 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 13 places in 68 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 57 places in 80 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 16 places in 69 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2021-05-14 19:15:51] [INFO ] Deduced a trap composed of 35 places in 59 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 71 places in 51 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 50 places in 51 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 33 places in 46 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 30 places in 54 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 49 places in 56 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 58 places in 58 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 41 places in 51 ms
[2021-05-14 19:15:52] [INFO ] Deduced a trap composed of 49 places in 59 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 45 places in 80 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 56 places in 49 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 51 places in 51 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 50 places in 52 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 49 places in 59 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2021-05-14 19:15:53] [INFO ] Deduced a trap composed of 49 places in 72 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 13 places in 58 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 34 places in 55 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 53 places in 50 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 39 places in 47 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 66 places in 43 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 40 places in 49 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 61 places in 49 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 61 places in 50 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 72 places in 49 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-14 19:15:54] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 56 places in 47 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 56 places in 51 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 62 places in 48 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 54 places in 51 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 38 places in 56 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 53 places in 51 ms
[2021-05-14 19:15:55] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2021-05-14 19:15:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 55 trap constraints in 4607 ms
[2021-05-14 19:15:55] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:15:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:56] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-14 19:15:56] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:15:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-14 19:15:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:56] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2021-05-14 19:15:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 20 ms returned sat
[2021-05-14 19:15:56] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2021-05-14 19:15:56] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2021-05-14 19:15:56] [INFO ] Deduced a trap composed of 71 places in 71 ms
[2021-05-14 19:15:56] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 49 places in 63 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 18 places in 63 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 32 places in 61 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 38 places in 61 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 33 places in 61 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 45 places in 33 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 45 places in 32 ms
[2021-05-14 19:15:57] [INFO ] Deduced a trap composed of 45 places in 32 ms
[2021-05-14 19:15:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1143 ms
[2021-05-14 19:15:57] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2021-05-14 19:15:58] [INFO ] Added : 303 causal constraints over 61 iterations in 1176 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:59] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-14 19:15:59] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:15:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:15:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:15:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:15:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:15:59] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2021-05-14 19:15:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 93 places in 77 ms
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 84 places in 71 ms
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 13 places in 61 ms
[2021-05-14 19:15:59] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 38 places in 57 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 58 places in 64 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 38 places in 55 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 65 places in 43 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 65 places in 39 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 53 places in 42 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 66 places in 41 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 69 places in 41 ms
[2021-05-14 19:16:00] [INFO ] Deduced a trap composed of 51 places in 41 ms
[2021-05-14 19:16:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1357 ms
[2021-05-14 19:16:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2021-05-14 19:16:01] [INFO ] Added : 236 causal constraints over 48 iterations in 874 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 19:16:01] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-14 19:16:01] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 19:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:02] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:16:02] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-14 19:16:02] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 29 places in 67 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 71 places in 66 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 24 places in 58 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 13 places in 56 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2021-05-14 19:16:02] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2021-05-14 19:16:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 536 ms
[2021-05-14 19:16:02] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2021-05-14 19:16:03] [INFO ] Added : 217 causal constraints over 44 iterations in 771 ms. Result :sat
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2021-05-14 19:16:03] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2021-05-14 19:16:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA Peterson-COL-3-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 33490 steps, including 532 resets, run visited all 6 properties in 277 ms. (steps per millisecond=120 )
FORMULA Peterson-COL-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-02 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="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
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 r151-tall-162089151400284"
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 '
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 ;