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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K 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 94K 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.3K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 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 139K 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-60b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620517218101

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 23:40:19] [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 23:40:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 23:40:19] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-08 23:40:19] [INFO ] Transformed 519 places.
[2021-05-08 23:40:19] [INFO ] Transformed 470 transitions.
[2021-05-08 23:40:19] [INFO ] Found NUPN structural information;
[2021-05-08 23:40:19] [INFO ] Parsed PT model containing 519 places and 470 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-60b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 75 ms. (steps per millisecond=133 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1]
FORMULA DES-PT-60b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 470 rows 519 cols
[2021-05-08 23:40:20] [INFO ] Computed 65 place invariants in 39 ms
[2021-05-08 23:40:20] [INFO ] [Real]Absence check using 39 positive place invariants in 38 ms returned sat
[2021-05-08 23:40:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2021-05-08 23:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:21] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2021-05-08 23:40:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:40:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 46 ms returned unsat
[2021-05-08 23:40:21] [INFO ] [Real]Absence check using 39 positive place invariants in 39 ms returned sat
[2021-05-08 23:40:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2021-05-08 23:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:22] [INFO ] [Real]Absence check using state equation in 1261 ms returned sat
[2021-05-08 23:40:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:40:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 40 ms returned sat
[2021-05-08 23:40:22] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2021-05-08 23:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:23] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 20 places in 218 ms
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 8 places in 179 ms
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 20 places in 123 ms
[2021-05-08 23:40:24] [INFO ] Deduced a trap composed of 21 places in 122 ms
[2021-05-08 23:40:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1126 ms
[2021-05-08 23:40:25] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 24 ms.
[2021-05-08 23:40:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t407 0) (and (and (> t406 0) (< o406 o407)) (or (and (> t82 0) (< o82 o407)) (and (> t83 0) (< o83 o407)))))") while checking expression at index 1
[2021-05-08 23:40:27] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 23:40:27] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 29 ms returned sat
[2021-05-08 23:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:28] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2021-05-08 23:40:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:40:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 42 ms returned sat
[2021-05-08 23:40:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2021-05-08 23:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:29] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2021-05-08 23:40:30] [INFO ] Deduced a trap composed of 12 places in 197 ms
[2021-05-08 23:40:30] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2021-05-08 23:40:30] [INFO ] Deduced a trap composed of 21 places in 283 ms
[2021-05-08 23:40:30] [INFO ] Deduced a trap composed of 41 places in 142 ms
[2021-05-08 23:40:30] [INFO ] Deduced a trap composed of 24 places in 116 ms
[2021-05-08 23:40:31] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2021-05-08 23:40:31] [INFO ] Deduced a trap composed of 19 places in 59 ms
[2021-05-08 23:40:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1264 ms
[2021-05-08 23:40:31] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 36 ms.
[2021-05-08 23:40:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t375 0) (and (and (> t374 0) (< o374 o375)) (or (and (> t82 0) (< o82 o375)) (and (> t83 0) (< o83 o375)))))") while checking expression at index 2
[2021-05-08 23:40:33] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2021-05-08 23:40:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2021-05-08 23:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:36] [INFO ] [Real]Absence check using state equation in 2384 ms returned sat
[2021-05-08 23:40:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:40:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 42 ms returned sat
[2021-05-08 23:40:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 100 ms returned sat
[2021-05-08 23:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:37] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 9 places in 138 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 15 places in 98 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 14 places in 71 ms
[2021-05-08 23:40:38] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2021-05-08 23:40:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 983 ms
[2021-05-08 23:40:39] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 23 ms.
[2021-05-08 23:40:41] [INFO ] Added : 304 causal constraints over 61 iterations in 2387 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-08 23:40:41] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2021-05-08 23:40:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 30 ms returned sat
[2021-05-08 23:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:42] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2021-05-08 23:40:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:40:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 49 ms returned sat
[2021-05-08 23:40:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2021-05-08 23:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:40:43] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2021-05-08 23:40:43] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2021-05-08 23:40:44] [INFO ] Deduced a trap composed of 8 places in 128 ms
[2021-05-08 23:40:44] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2021-05-08 23:40:44] [INFO ] Deduced a trap composed of 37 places in 118 ms
[2021-05-08 23:40:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 566 ms
[2021-05-08 23:40:44] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 24 ms.
[2021-05-08 23:40:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t451 0) (and (and (> t75 0) (< o75 o451)) (and (> t444 0) (< o444 o451))))") while checking expression at index 4
FORMULA DES-PT-60b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 369600 steps, including 3893 resets, run finished after 1108 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 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 508 transition count 442
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 487 transition count 442
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 487 transition count 433
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 478 transition count 433
Symmetric choice reduction at 2 with 18 rule applications. Total rules 81 place count 478 transition count 433
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 117 place count 460 transition count 415
Symmetric choice reduction at 2 with 15 rule applications. Total rules 132 place count 460 transition count 415
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 162 place count 445 transition count 400
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 177 place count 445 transition count 385
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 180 place count 443 transition count 384
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 443 transition count 382
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 441 transition count 382
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 328 place count 369 transition count 310
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 332 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 366 transition count 311
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 336 place count 365 transition count 310
Applied a total of 336 rules in 237 ms. Remains 365 /519 variables (removed 154) and now considering 310/470 (removed 160) transitions.
Finished structural reductions, in 1 iterations. Remains : 365/519 places, 310/470 transitions.
Incomplete random walk after 1000000 steps, including 34965 resets, run finished after 3568 ms. (steps per millisecond=280 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6895 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6892 resets, run finished after 1264 ms. (steps per millisecond=791 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5363 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6495 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 14549626 steps, run timeout after 30001 ms. (steps per millisecond=484 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 14549626 steps, saw 1693237 distinct states, run finished after 30001 ms. (steps per millisecond=484 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 310 rows 365 cols
[2021-05-08 23:41:27] [INFO ] Computed 61 place invariants in 8 ms
[2021-05-08 23:41:27] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:27] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:28] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2021-05-08 23:41:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:28] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 23:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:29] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2021-05-08 23:41:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 23:41:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:41:29] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-08 23:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-08 23:41:29] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 15 ms.
[2021-05-08 23:41:31] [INFO ] Added : 293 causal constraints over 59 iterations in 2445 ms. Result :sat
[2021-05-08 23:41:31] [INFO ] Deduced a trap composed of 60 places in 26 ms
[2021-05-08 23:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-08 23:41:31] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:31] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 23:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:32] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2021-05-08 23:41:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:32] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 23:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:33] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2021-05-08 23:41:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:41:33] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-08 23:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 23:41:33] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 14 ms.
[2021-05-08 23:41:35] [INFO ] Added : 238 causal constraints over 48 iterations in 1791 ms. Result :sat
[2021-05-08 23:41:35] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2021-05-08 23:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 23:41:35] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:35] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:35] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2021-05-08 23:41:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 23:41:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 23:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:37] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2021-05-08 23:41:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2021-05-08 23:41:37] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 16 ms.
[2021-05-08 23:41:38] [INFO ] Added : 242 causal constraints over 49 iterations in 1665 ms. Result :sat
[2021-05-08 23:41:38] [INFO ] Deduced a trap composed of 60 places in 26 ms
[2021-05-08 23:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-08 23:41:38] [INFO ] [Real]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 23:41:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 16 ms returned sat
[2021-05-08 23:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:39] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2021-05-08 23:41:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 23:41:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 23:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:40] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2021-05-08 23:41:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2021-05-08 23:41:40] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 15 ms.
[2021-05-08 23:41:41] [INFO ] Added : 244 causal constraints over 49 iterations in 1486 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 223800 steps, including 9952 resets, run finished after 844 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 288600 steps, including 12774 resets, run finished after 1061 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 209000 steps, including 9311 resets, run finished after 769 ms. (steps per millisecond=271 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 321800 steps, including 14482 resets, run finished after 1188 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 365 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 365/365 places, 310/310 transitions.
Applied a total of 0 rules in 23 ms. Remains 365 /365 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 365/365 places, 310/310 transitions.
Starting structural reductions, iteration 0 : 365/365 places, 310/310 transitions.
Applied a total of 0 rules in 18 ms. Remains 365 /365 variables (removed 0) and now considering 310/310 (removed 0) transitions.
// Phase 1: matrix 310 rows 365 cols
[2021-05-08 23:41:45] [INFO ] Computed 61 place invariants in 11 ms
[2021-05-08 23:41:46] [INFO ] Implicit Places using invariants in 811 ms returned []
// Phase 1: matrix 310 rows 365 cols
[2021-05-08 23:41:46] [INFO ] Computed 61 place invariants in 5 ms
[2021-05-08 23:41:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 23:41:49] [INFO ] Implicit Places using invariants and state equation in 3195 ms returned []
Implicit Place search using SMT with State Equation took 4007 ms to find 0 implicit places.
[2021-05-08 23:41:49] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 310 rows 365 cols
[2021-05-08 23:41:49] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 23:41:50] [INFO ] Dead Transitions using invariants and state equation in 681 ms returned []
Finished structural reductions, in 1 iterations. Remains : 365/365 places, 310/310 transitions.
Incomplete random walk after 100000 steps, including 3460 resets, run finished after 354 ms. (steps per millisecond=282 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 310 rows 365 cols
[2021-05-08 23:41:50] [INFO ] Computed 61 place invariants in 4 ms
[2021-05-08 23:41:51] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:51] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2021-05-08 23:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:51] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2021-05-08 23:41:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2021-05-08 23:41:51] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 23:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:52] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2021-05-08 23:41:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-08 23:41:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:41:52] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-08 23:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-08 23:41:52] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 14 ms.
[2021-05-08 23:41:54] [INFO ] Added : 293 causal constraints over 59 iterations in 2399 ms. Result :sat
[2021-05-08 23:41:54] [INFO ] Deduced a trap composed of 60 places in 42 ms
[2021-05-08 23:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2021-05-08 23:41:55] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:55] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 23:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:55] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2021-05-08 23:41:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:55] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 23:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:56] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2021-05-08 23:41:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2021-05-08 23:41:56] [INFO ] Deduced a trap composed of 5 places in 24 ms
[2021-05-08 23:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 23:41:56] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 15 ms.
[2021-05-08 23:41:58] [INFO ] Added : 238 causal constraints over 48 iterations in 1731 ms. Result :sat
[2021-05-08 23:41:58] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2021-05-08 23:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2021-05-08 23:41:58] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:58] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-08 23:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:41:58] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-08 23:41:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:41:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:41:59] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2021-05-08 23:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:00] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2021-05-08 23:42:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2021-05-08 23:42:00] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 15 ms.
[2021-05-08 23:42:01] [INFO ] Added : 242 causal constraints over 49 iterations in 1673 ms. Result :sat
[2021-05-08 23:42:01] [INFO ] Deduced a trap composed of 60 places in 26 ms
[2021-05-08 23:42:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-08 23:42:01] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2021-05-08 23:42:01] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 17 ms returned sat
[2021-05-08 23:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:02] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-08 23:42:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2021-05-08 23:42:02] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 44 ms returned sat
[2021-05-08 23:42:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:03] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2021-05-08 23:42:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2021-05-08 23:42:03] [INFO ] Computed and/alt/rep : 305/1578/305 causal constraints in 15 ms.
[2021-05-08 23:42:04] [INFO ] Added : 244 causal constraints over 49 iterations in 1463 ms. Result :sat
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1232 edges and 365 vertex of which 364 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 364 transition count 310
Applied a total of 2 rules in 20 ms. Remains 364 /365 variables (removed 1) and now considering 310/310 (removed 0) transitions.
// Phase 1: matrix 310 rows 364 cols
[2021-05-08 23:42:04] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 23:42:05] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2021-05-08 23:42:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2021-05-08 23:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:05] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2021-05-08 23:42:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 23:42:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2021-05-08 23:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:06] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2021-05-08 23:42:06] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-08 23:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-08 23:42:06] [INFO ] Computed and/alt/rep : 305/1550/305 causal constraints in 15 ms.
[2021-05-08 23:42:08] [INFO ] Added : 287 causal constraints over 58 iterations in 1685 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 23:42:08] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2021-05-08 23:42:08] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:08] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-08 23:42:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 23:42:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 63 ms returned sat
[2021-05-08 23:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:10] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2021-05-08 23:42:10] [INFO ] Deduced a trap composed of 3 places in 91 ms
[2021-05-08 23:42:10] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-08 23:42:10] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-08 23:42:10] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-08 23:42:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 316 ms
[2021-05-08 23:42:10] [INFO ] Computed and/alt/rep : 305/1550/305 causal constraints in 14 ms.
[2021-05-08 23:42:11] [INFO ] Added : 227 causal constraints over 46 iterations in 1114 ms. Result :sat
[2021-05-08 23:42:11] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2021-05-08 23:42:11] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2021-05-08 23:42:11] [INFO ] Deduced a trap composed of 17 places in 61 ms
[2021-05-08 23:42:11] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2021-05-08 23:42:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 373 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-08 23:42:12] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 23:42:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-08 23:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:13] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2021-05-08 23:42:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 23:42:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 72 ms returned sat
[2021-05-08 23:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:14] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2021-05-08 23:42:14] [INFO ] Computed and/alt/rep : 305/1550/305 causal constraints in 15 ms.
[2021-05-08 23:42:16] [INFO ] Added : 276 causal constraints over 56 iterations in 1837 ms. Result :sat
[2021-05-08 23:42:16] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2021-05-08 23:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2021-05-08 23:42:16] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-08 23:42:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2021-05-08 23:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:16] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2021-05-08 23:42:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:42:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2021-05-08 23:42:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 115 ms returned sat
[2021-05-08 23:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:42:17] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-08 23:42:17] [INFO ] Deduced a trap composed of 5 places in 103 ms
[2021-05-08 23:42:18] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2021-05-08 23:42:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 563 ms
[2021-05-08 23:42:18] [INFO ] Computed and/alt/rep : 305/1550/305 causal constraints in 14 ms.
[2021-05-08 23:42:19] [INFO ] Added : 237 causal constraints over 48 iterations in 1500 ms. Result :sat
[2021-05-08 23:42:19] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2021-05-08 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-08 23:42:19] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-08 23:42:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-08 23:42:19] [INFO ] Flatten gal took : 84 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-60b @ 3570 seconds

FORMULA DES-PT-60b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-60b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 23:42:21 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1163
},
"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 ((((p79 <= 0)) OR ((1 <= p284)))))",
"processed_size": 40,
"rewrites": 2
},
"result":
{
"edges": 13260376,
"markings": 12021784,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 1720
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"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 ((((p6 <= 0)) OR ((1 <= p158)) OR (((p188 <= 0)) AND ((1 <= p219)) AND ((p316 <= 0))))))",
"processed_size": 95,
"rewrites": 2
},
"result":
{
"edges": 37127778,
"markings": 28144216,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 7,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p251)) OR (((1 <= p279)) AND ((p312 <= 0))) OR ((((p2 <= 0)) OR ((1 <= p167))) AND (((p192 <= 0)) OR ((1 <= p252))) AND (((p37 <= 0)) OR ((1 <= p197))) AND (((p203 <= 0)) OR ((1 <= p331)))))))",
"processed_size": 212,
"rewrites": 2
},
"result":
{
"edges": 556230,
"markings": 399331,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 24416,
"runtime": 256.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 1501,
"conflict_clusters": 55,
"places": 365,
"places_significant": 304,
"singleton_clusters": 0,
"transitions": 310
},
"result":
{
"preliminary_value": "no yes no no ",
"value": "no yes 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: 675/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 365
lola: finding significant places
lola: 365 places, 310 transitions, 304 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: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p316 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: A (G ((((p6 <= 0)) OR ((1 <= p158)) OR (((p188 <= 0)) AND ((1 <= p219)) AND ((p316 <= 0)))))) : E (F (((1 <= p24)))) : A (G ((((1 <= p251)) OR (((1 <= p279)) AND ((p312 <= 0))) OR ((((p2 <= 0)) OR ((1 <= p167))) AND (((p192 <= 0)) OR ((1 <= p252))) AND (((p37 <= 0)) OR ((1 <= p197))) AND (((p203 <= 0)) OR ((1 <= p331))))))) : A (G ((((p79 <= 0)) OR ((1 <= p284)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p24))))
lola: processed formula length: 20
lola: 1 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p24))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 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: sara is running 0 secs || 1060501 markings, 1357730 edges, 212100 markings/sec, 0 secs
lola: sara is running 5 secs || 2126553 markings, 2748977 edges, 213210 markings/sec, 5 secs
lola: sara is running 10 secs || 3190145 markings, 4153823 edges, 212718 markings/sec, 10 secs
lola: sara is running 15 secs || 4262678 markings, 5562374 edges, 214507 markings/sec, 15 secs
lola: sara is running 20 secs || 5340186 markings, 6979091 edges, 215502 markings/sec, 20 secs
lola: sara is running 25 secs || 6414584 markings, 8403995 edges, 214880 markings/sec, 25 secs
lola: sara is running 30 secs || 7497435 markings, 9835963 edges, 216570 markings/sec, 30 secs
lola: sara is running 35 secs || 8581282 markings, 11258474 edges, 216769 markings/sec, 35 secs
lola: sara is running 40 secs || 9656026 markings, 12671392 edges, 214949 markings/sec, 40 secs
lola: sara is running 45 secs || 10725318 markings, 14084683 edges, 213858 markings/sec, 45 secs
lola: sara is running 50 secs || 11795819 markings, 15508194 edges, 214100 markings/sec, 50 secs
lola: sara is running 55 secs || 12872273 markings, 16921552 edges, 215291 markings/sec, 55 secs
lola: sara is running 60 secs || 13950796 markings, 18337040 edges, 215705 markings/sec, 60 secs
lola: sara is running 65 secs || 15024088 markings, 19752243 edges, 214658 markings/sec, 65 secs
lola: sara is running 70 secs || 16095565 markings, 21179451 edges, 214295 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16707991 markings, 21987070 edges
lola: ========================================
lola: subprocess 1 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p79 <= 0)) OR ((1 <= p284)))))
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 ((((p79 <= 0)) OR ((1 <= p284)))))
lola: processed formula length: 40
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 <= p79)) AND ((p284 <= 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: sara is running 0 secs || 1301772 markings, 1393766 edges, 260354 markings/sec, 0 secs
lola: sara is running 5 secs || 2564159 markings, 2792382 edges, 252477 markings/sec, 5 secs
lola: sara is running 10 secs || 3823829 markings, 4187319 edges, 251934 markings/sec, 10 secs
lola: sara is running 15 secs || 5081546 markings, 5579470 edges, 251543 markings/sec, 15 secs
lola: sara is running 20 secs || 6325583 markings, 6955198 edges, 248807 markings/sec, 20 secs
lola: sara is running 25 secs || 7558322 markings, 8319396 edges, 246548 markings/sec, 25 secs
lola: sara is running 30 secs || 8798128 markings, 9691779 edges, 247961 markings/sec, 30 secs
lola: sara is running 35 secs || 10046328 markings, 11072430 edges, 249640 markings/sec, 35 secs
lola: sara is running 40 secs || 11308958 markings, 12469678 edges, 252526 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12021784 markings, 13260376 edges
lola: ========================================
lola: subprocess 2 will run for 1720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6 <= 0)) OR ((1 <= p158)) OR (((p188 <= 0)) AND ((1 <= p219)) AND ((p316 <= 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 ((((p6 <= 0)) OR ((1 <= p158)) OR (((p188 <= 0)) AND ((1 <= p219)) AND ((p316 <= 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 <= p6)) AND ((p158 <= 0)) AND (((1 <= p188)) OR ((p219 <= 0)) OR ((1 <= p316))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1179522 markings, 1515440 edges, 235904 markings/sec, 0 secs
lola: sara is running 5 secs || 2349857 markings, 3035321 edges, 234067 markings/sec, 5 secs
lola: sara is running 10 secs || 3505037 markings, 4558910 edges, 231036 markings/sec, 10 secs
lola: sara is running 15 secs || 4662083 markings, 6085167 edges, 231409 markings/sec, 15 secs
lola: sara is running 20 secs || 5813127 markings, 7610376 edges, 230209 markings/sec, 20 secs
lola: sara is running 25 secs || 6959887 markings, 9128887 edges, 229352 markings/sec, 25 secs
lola: sara is running 30 secs || 8115492 markings, 10644172 edges, 231121 markings/sec, 30 secs
lola: sara is running 35 secs || 9264935 markings, 12144322 edges, 229889 markings/sec, 35 secs
lola: sara is running 40 secs || 10404426 markings, 13633954 edges, 227898 markings/sec, 40 secs
lola: sara is running 45 secs || 11509031 markings, 15128225 edges, 220921 markings/sec, 45 secs
lola: sara is running 50 secs || 12608284 markings, 16604623 edges, 219851 markings/sec, 50 secs
lola: sara is running 55 secs || 13709531 markings, 18075051 edges, 220249 markings/sec, 55 secs
lola: sara is running 60 secs || 14814846 markings, 19539322 edges, 221063 markings/sec, 60 secs
lola: sara is running 65 secs || 15917728 markings, 21001891 edges, 220576 markings/sec, 65 secs
lola: sara is running 70 secs || 17027121 markings, 22459612 edges, 221879 markings/sec, 70 secs
lola: sara is running 75 secs || 18134058 markings, 23914767 edges, 221387 markings/sec, 75 secs
lola: sara is running 80 secs || 19242968 markings, 25373081 edges, 221782 markings/sec, 80 secs
lola: sara is running 85 secs || 20345425 markings, 26829115 edges, 220491 markings/sec, 85 secs
lola: sara is running 90 secs || 21451691 markings, 28298874 edges, 221253 markings/sec, 90 secs
lola: sara is running 95 secs || 22570050 markings, 29770685 edges, 223672 markings/sec, 95 secs
lola: sara is running 100 secs || 23683450 markings, 31236243 edges, 222680 markings/sec, 100 secs
lola: sara is running 105 secs || 24799843 markings, 32703531 edges, 223279 markings/sec, 105 secs
lola: sara is running 110 secs || 25911284 markings, 34168477 edges, 222288 markings/sec, 110 secs
lola: sara is running 115 secs || 27021632 markings, 35637236 edges, 222070 markings/sec, 115 secs
lola: sara is running 120 secs || 28137036 markings, 37118764 edges, 223081 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28144216 markings, 37127778 edges
lola: ========================================
lola: subprocess 3 will run for 3316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p251)) OR (((1 <= p279)) AND ((p312 <= 0))) OR ((((p2 <= 0)) OR ((1 <= p167))) AND (((p192 <= 0)) OR ((1 <= p252))) AND (((p37 <= 0)) OR ((1 <= p197))) AND (((p203 <= 0)) OR ((1 <= p331)))))))
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 ((((1 <= p251)) OR (((1 <= p279)) AND ((p312 <= 0))) OR ((((p2 <= 0)) OR ((1 <= p167))) AND (((p192 <= 0)) OR ((1 <= p252))) AND (((p37 <= 0)) OR ((1 <= p197))) AND (((p203 <= 0)) OR ((1 <= p331)))))))
lola: processed formula length: 212
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: (((p251 <= 0)) AND (((p279 <= 0)) OR ((1 <= p312))) AND ((((1 <= p2)) AND ((p167 <= 0))) OR (((1 <= p192)) AND ((p252 <= 0))) OR (((1 <= p37)) AND ((p197 <= 0))) OR (((1 <= p203)) AND ((p331 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-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: 399331 markings, 556230 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no
lola:
preliminary result: no yes no no
lola: memory consumption: 24416 KB
lola: time consumption: 256 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-60b"
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-60b, 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-162039097200079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 ;