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.r075-tall-162039097100055.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 DES-PT-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 103K 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 DES-PT-30b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620509682136

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 21:34:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 21:34:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 21:34:43] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-08 21:34:43] [INFO ] Transformed 399 places.
[2021-05-08 21:34:43] [INFO ] Transformed 350 transitions.
[2021-05-08 21:34:43] [INFO ] Found NUPN structural information;
[2021-05-08 21:34:43] [INFO ] Parsed PT model containing 399 places and 350 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-30b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 90 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
FORMULA DES-PT-30b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0]
// Phase 1: matrix 350 rows 399 cols
[2021-05-08 21:34:44] [INFO ] Computed 65 place invariants in 29 ms
[2021-05-08 21:34:44] [INFO ] [Real]Absence check using 39 positive place invariants in 36 ms returned sat
[2021-05-08 21:34:44] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2021-05-08 21:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:34:45] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2021-05-08 21:34:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:34:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2021-05-08 21:34:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2021-05-08 21:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:34:45] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2021-05-08 21:34:45] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2021-05-08 21:34:46] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2021-05-08 21:34:46] [INFO ] Deduced a trap composed of 21 places in 42 ms
[2021-05-08 21:34:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2021-05-08 21:34:46] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 26 ms.
[2021-05-08 21:34:48] [INFO ] Added : 286 causal constraints over 58 iterations in 1905 ms. Result :sat
[2021-05-08 21:34:48] [INFO ] Deduced a trap composed of 59 places in 120 ms
[2021-05-08 21:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 21:34:48] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2021-05-08 21:34:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2021-05-08 21:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:34:48] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-08 21:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:34:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 35 ms returned sat
[2021-05-08 21:34:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2021-05-08 21:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:34:49] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-08 21:34:49] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2021-05-08 21:34:49] [INFO ] Deduced a trap composed of 13 places in 42 ms
[2021-05-08 21:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2021-05-08 21:34:49] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 40 ms.
[2021-05-08 21:34:51] [INFO ] Added : 343 causal constraints over 69 iterations in 1862 ms. Result :sat
[2021-05-08 21:34:51] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2021-05-08 21:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 445700 steps, including 4665 resets, run finished after 1253 ms. (steps per millisecond=355 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 236100 steps, including 2529 resets, run finished after 637 ms. (steps per millisecond=370 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 858 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 393 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 372 transition count 323
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 372 transition count 314
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 363 transition count 314
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 363 transition count 314
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 344 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 344 transition count 294
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 343 transition count 294
Symmetric choice reduction at 2 with 15 rule applications. Total rules 137 place count 343 transition count 294
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 167 place count 328 transition count 279
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 182 place count 328 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 185 place count 326 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 185 place count 326 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 323 transition count 260
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 335 place count 251 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 339 place count 249 transition count 190
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 249 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 248 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 247 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 343 place count 246 transition count 188
Applied a total of 343 rules in 151 ms. Remains 246 /399 variables (removed 153) and now considering 188/350 (removed 162) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/399 places, 188/350 transitions.
Incomplete random walk after 1000000 steps, including 39690 resets, run finished after 3073 ms. (steps per millisecond=325 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6497 resets, run finished after 1178 ms. (steps per millisecond=848 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6876 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 16114583 steps, run timeout after 30001 ms. (steps per millisecond=537 ) properties seen :[0, 0]
Probabilistic random walk after 16114583 steps, saw 2164677 distinct states, run finished after 30001 ms. (steps per millisecond=537 ) properties seen :[0, 0]
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:28] [INFO ] Computed 64 place invariants in 6 ms
[2021-05-08 21:35:29] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:29] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 21:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:29] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-08 21:35:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 21:35:29] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 21:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:29] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-08 21:35:29] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-08 21:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-08 21:35:29] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 13 ms.
[2021-05-08 21:35:30] [INFO ] Added : 140 causal constraints over 28 iterations in 502 ms. Result :sat
[2021-05-08 21:35:30] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2021-05-08 21:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 21:35:30] [INFO ] [Real]Absence check using 39 positive place invariants in 22 ms returned sat
[2021-05-08 21:35:30] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 26 ms returned sat
[2021-05-08 21:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:30] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-08 21:35:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:30] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 21:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:30] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-08 21:35:30] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2021-05-08 21:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2021-05-08 21:35:30] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 11 ms.
[2021-05-08 21:35:31] [INFO ] Added : 183 causal constraints over 37 iterations in 483 ms. Result :sat
[2021-05-08 21:35:31] [INFO ] Deduced a trap composed of 13 places in 29 ms
[2021-05-08 21:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 154300 steps, including 9052 resets, run finished after 540 ms. (steps per millisecond=285 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 86100 steps, including 4990 resets, run finished after 278 ms. (steps per millisecond=309 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 246 /246 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 188/188 transitions.
Starting structural reductions, iteration 0 : 246/246 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 246 /246 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:32] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-08 21:35:32] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:32] [INFO ] Computed 64 place invariants in 11 ms
[2021-05-08 21:35:33] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2021-05-08 21:35:33] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:33] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-08 21:35:34] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 188/188 transitions.
Incomplete random walk after 100000 steps, including 3912 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[0, 0]
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:34] [INFO ] Computed 64 place invariants in 2 ms
[2021-05-08 21:35:34] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:34] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 21:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:34] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2021-05-08 21:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:35] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:35] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 46 ms returned sat
[2021-05-08 21:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:35] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 21:35:35] [INFO ] Deduced a trap composed of 6 places in 30 ms
[2021-05-08 21:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2021-05-08 21:35:35] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 11 ms.
[2021-05-08 21:35:35] [INFO ] Added : 140 causal constraints over 28 iterations in 491 ms. Result :sat
[2021-05-08 21:35:35] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2021-05-08 21:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2021-05-08 21:35:35] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 21:35:35] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 21:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:36] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-08 21:35:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 21:35:36] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2021-05-08 21:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:36] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 21:35:36] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2021-05-08 21:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-08 21:35:36] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 11 ms.
[2021-05-08 21:35:36] [INFO ] Added : 183 causal constraints over 37 iterations in 482 ms. Result :sat
[2021-05-08 21:35:36] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2021-05-08 21:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
Applied a total of 0 rules in 9 ms. Remains 246 /246 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 246 cols
[2021-05-08 21:35:37] [INFO ] Computed 64 place invariants in 3 ms
[2021-05-08 21:35:37] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:37] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 21:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:37] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-08 21:35:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 21:35:37] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 21:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:37] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-08 21:35:37] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2021-05-08 21:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-08 21:35:37] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 12 ms.
[2021-05-08 21:35:38] [INFO ] Added : 140 causal constraints over 28 iterations in 505 ms. Result :sat
[2021-05-08 21:35:38] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2021-05-08 21:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 21:35:38] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 21:35:38] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 21:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:38] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-08 21:35:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 21:35:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 21:35:38] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 21:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 21:35:38] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-08 21:35:38] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2021-05-08 21:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-08 21:35:38] [INFO ] Computed and/alt/rep : 183/688/183 causal constraints in 10 ms.
[2021-05-08 21:35:39] [INFO ] Added : 183 causal constraints over 37 iterations in 486 ms. Result :sat
[2021-05-08 21:35:39] [INFO ] Deduced a trap composed of 13 places in 30 ms
[2021-05-08 21:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 21:35:39] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-08 21:35:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2021-05-08 21:35:39] [INFO ] Flatten gal took : 57 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-30b @ 3570 seconds

FORMULA DES-PT-30b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for ReachabilityCardinality @ DES-PT-30b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 21:35:40 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p0 <= 0)) OR ((1 <= p182)))))",
"processed_size": 39,
"rewrites": 2
},
"result":
{
"edges": 362903,
"markings": 316835,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p46 <= 0)) OR ((1 <= p178)) OR ((1 <= p215)) OR (((p98 <= 0)) AND ((p195 <= 0))))))",
"processed_size": 95,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19592,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 918,
"conflict_clusters": 55,
"places": 246,
"places_significant": 182,
"singleton_clusters": 0,
"transitions": 188
},
"result":
{
"preliminary_value": "no no ",
"value": "no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 434/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 246
lola: finding significant places
lola: 246 places, 188 transitions, 182 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: A (G ((((p46 <= 0)) OR ((1 <= p178)) OR ((1 <= p215)) OR (((p98 <= 0)) AND ((p195 <= 0)))))) : A (G ((((p0 <= 0)) OR ((1 <= p182)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p0 <= 0)) OR ((1 <= p182)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p0 <= 0)) OR ((1 <= p182)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p0)) AND ((p182 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 316835 markings, 362903 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p46 <= 0)) OR ((1 <= p178)) OR ((1 <= p215)) OR (((p98 <= 0)) AND ((p195 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p46 <= 0)) OR ((1 <= p178)) OR ((1 <= p215)) OR (((p98 <= 0)) AND ((p195 <= 0))))))
lola: processed formula length: 95
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p46)) AND ((p178 <= 0)) AND ((p215 <= 0)) AND (((1 <= p98)) OR ((1 <= p195))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: memory consumption: 19592 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

--------------------
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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-30b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097100055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;