fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r227-tall-162098231300408
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldPPPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
470.892 3600000.00 155331.00 424.00 TTTFTTFTTTTFTTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231300408.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 ShieldPPPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300408
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 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.0K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 569K May 5 16:52 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 ShieldPPPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621181634996

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 16:13:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 16:13:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:13:56] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2021-05-16 16:13:56] [INFO ] Transformed 2343 places.
[2021-05-16 16:13:56] [INFO ] Transformed 2133 transitions.
[2021-05-16 16:13:56] [INFO ] Found NUPN structural information;
[2021-05-16 16:13:56] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 156 ms. (steps per millisecond=64 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0]
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2133 rows 2343 cols
[2021-05-16 16:13:57] [INFO ] Computed 331 place invariants in 48 ms
[2021-05-16 16:13:58] [INFO ] [Real]Absence check using 331 positive place invariants in 417 ms returned sat
[2021-05-16 16:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:02] [INFO ] [Real]Absence check using state equation in 4126 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:03] [INFO ] [Real]Absence check using 331 positive place invariants in 415 ms returned sat
[2021-05-16 16:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:07] [INFO ] [Real]Absence check using state equation in 4175 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:08] [INFO ] [Real]Absence check using 331 positive place invariants in 416 ms returned sat
[2021-05-16 16:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:12] [INFO ] [Real]Absence check using state equation in 4313 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:13] [INFO ] [Real]Absence check using 331 positive place invariants in 399 ms returned sat
[2021-05-16 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:17] [INFO ] [Real]Absence check using state equation in 4289 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:18] [INFO ] [Real]Absence check using 331 positive place invariants in 401 ms returned sat
[2021-05-16 16:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:22] [INFO ] [Real]Absence check using state equation in 4318 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:23] [INFO ] [Real]Absence check using 331 positive place invariants in 393 ms returned sat
[2021-05-16 16:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:27] [INFO ] [Real]Absence check using state equation in 4267 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:28] [INFO ] [Real]Absence check using 331 positive place invariants in 397 ms returned sat
[2021-05-16 16:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:32] [INFO ] [Real]Absence check using state equation in 4342 ms returned (error "Failed to check-sat")
[2021-05-16 16:14:33] [INFO ] [Real]Absence check using 331 positive place invariants in 408 ms returned sat
[2021-05-16 16:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:14:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 16:14:37] [INFO ] [Real]Absence check using state equation in 4322 ms returned (error "Failed to check-sat")
Support contains 34 out of 2343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Performed 560 Post agglomeration using F-continuation condition.Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2343 transition count 1573
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 562 rules applied. Total rules applied 1122 place count 1783 transition count 1571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 1782 transition count 1571
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1123 place count 1782 transition count 1450
Deduced a syphon composed of 121 places in 8 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1365 place count 1661 transition count 1450
Symmetric choice reduction at 3 with 204 rule applications. Total rules 1569 place count 1661 transition count 1450
Deduced a syphon composed of 204 places in 9 ms
Reduce places removed 204 places and 204 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 1977 place count 1457 transition count 1246
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 1977 place count 1457 transition count 1166
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2137 place count 1377 transition count 1166
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 3 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 3129 place count 881 transition count 670
Renaming transitions due to excessive name length > 1024 char.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 3293 place count 799 transition count 670
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3294 place count 799 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3295 place count 798 transition count 669
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 4 with 87 rules applied. Total rules applied 3382 place count 798 transition count 669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3383 place count 797 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3384 place count 796 transition count 668
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3384 place count 796 transition count 666
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3388 place count 794 transition count 666
Applied a total of 3388 rules in 877 ms. Remains 794 /2343 variables (removed 1549) and now considering 666/2133 (removed 1467) transitions.
Finished structural reductions, in 1 iterations. Remains : 794/2343 places, 666/2133 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6955 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4019 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 4108 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4336 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4205 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4169 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4064 ms. (steps per millisecond=246 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4143 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4009 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 666 rows 794 cols
[2021-05-16 16:15:18] [INFO ] Computed 330 place invariants in 2 ms
[2021-05-16 16:15:18] [INFO ] [Real]Absence check using 330 positive place invariants in 152 ms returned sat
[2021-05-16 16:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:19] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2021-05-16 16:15:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-16 16:15:19] [INFO ] [Real]Added 53 Read/Feed constraints in 17 ms returned sat
[2021-05-16 16:15:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:20] [INFO ] [Nat]Absence check using 330 positive place invariants in 158 ms returned sat
[2021-05-16 16:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:21] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2021-05-16 16:15:21] [INFO ] [Nat]Added 53 Read/Feed constraints in 22 ms returned sat
[2021-05-16 16:15:21] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2021-05-16 16:15:21] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2021-05-16 16:15:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2021-05-16 16:15:21] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 37 ms.
[2021-05-16 16:15:27] [INFO ] Added : 627 causal constraints over 126 iterations in 5900 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-16 16:15:27] [INFO ] [Real]Absence check using 330 positive place invariants in 153 ms returned sat
[2021-05-16 16:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:28] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2021-05-16 16:15:28] [INFO ] [Real]Added 53 Read/Feed constraints in 11 ms returned sat
[2021-05-16 16:15:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:29] [INFO ] [Nat]Absence check using 330 positive place invariants in 148 ms returned sat
[2021-05-16 16:15:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:30] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2021-05-16 16:15:30] [INFO ] [Nat]Added 53 Read/Feed constraints in 27 ms returned sat
[2021-05-16 16:15:30] [INFO ] Deduced a trap composed of 5 places in 61 ms
[2021-05-16 16:15:30] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2021-05-16 16:15:30] [INFO ] Deduced a trap composed of 6 places in 55 ms
[2021-05-16 16:15:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2021-05-16 16:15:30] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 35 ms.
[2021-05-16 16:15:37] [INFO ] Added : 638 causal constraints over 128 iterations in 7181 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2021-05-16 16:15:38] [INFO ] [Real]Absence check using 330 positive place invariants in 153 ms returned sat
[2021-05-16 16:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:39] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2021-05-16 16:15:39] [INFO ] [Real]Added 53 Read/Feed constraints in 12 ms returned sat
[2021-05-16 16:15:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:39] [INFO ] [Nat]Absence check using 330 positive place invariants in 154 ms returned sat
[2021-05-16 16:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:40] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2021-05-16 16:15:40] [INFO ] [Nat]Added 53 Read/Feed constraints in 20 ms returned sat
[2021-05-16 16:15:40] [INFO ] Deduced a trap composed of 10 places in 74 ms
[2021-05-16 16:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2021-05-16 16:15:40] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 41 ms.
[2021-05-16 16:15:46] [INFO ] Added : 636 causal constraints over 130 iterations in 6160 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2021-05-16 16:15:47] [INFO ] [Real]Absence check using 330 positive place invariants in 147 ms returned sat
[2021-05-16 16:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:48] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2021-05-16 16:15:48] [INFO ] [Real]Added 53 Read/Feed constraints in 10 ms returned sat
[2021-05-16 16:15:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:48] [INFO ] [Nat]Absence check using 330 positive place invariants in 146 ms returned sat
[2021-05-16 16:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:49] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2021-05-16 16:15:49] [INFO ] [Nat]Added 53 Read/Feed constraints in 20 ms returned sat
[2021-05-16 16:15:49] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2021-05-16 16:15:49] [INFO ] Deduced a trap composed of 6 places in 96 ms
[2021-05-16 16:15:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2021-05-16 16:15:49] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 31 ms.
[2021-05-16 16:15:55] [INFO ] Added : 633 causal constraints over 127 iterations in 5481 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-16 16:15:55] [INFO ] [Real]Absence check using 330 positive place invariants in 150 ms returned sat
[2021-05-16 16:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:56] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2021-05-16 16:15:56] [INFO ] [Real]Added 53 Read/Feed constraints in 12 ms returned sat
[2021-05-16 16:15:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:15:57] [INFO ] [Nat]Absence check using 330 positive place invariants in 152 ms returned sat
[2021-05-16 16:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:15:58] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2021-05-16 16:15:58] [INFO ] [Nat]Added 53 Read/Feed constraints in 18 ms returned sat
[2021-05-16 16:15:58] [INFO ] Deduced a trap composed of 5 places in 93 ms
[2021-05-16 16:15:58] [INFO ] Deduced a trap composed of 3 places in 78 ms
[2021-05-16 16:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2021-05-16 16:15:58] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 26 ms.
[2021-05-16 16:16:02] [INFO ] Added : 494 causal constraints over 99 iterations in 4225 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2021-05-16 16:16:02] [INFO ] [Real]Absence check using 330 positive place invariants in 150 ms returned sat
[2021-05-16 16:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:16:04] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2021-05-16 16:16:04] [INFO ] [Real]Added 53 Read/Feed constraints in 10 ms returned sat
[2021-05-16 16:16:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:16:04] [INFO ] [Nat]Absence check using 330 positive place invariants in 147 ms returned sat
[2021-05-16 16:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:16:05] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2021-05-16 16:16:05] [INFO ] [Nat]Added 53 Read/Feed constraints in 22 ms returned sat
[2021-05-16 16:16:05] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2021-05-16 16:16:05] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2021-05-16 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2021-05-16 16:16:05] [INFO ] Computed and/alt/rep : 655/1806/655 causal constraints in 30 ms.
[2021-05-16 16:16:11] [INFO ] Added : 622 causal constraints over 125 iterations in 5474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 75000 steps, including 228 resets, run finished after 602 ms. (steps per millisecond=124 ) properties seen :[1, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 71900 steps, including 158 resets, run finished after 493 ms. (steps per millisecond=145 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 94600 steps, including 368 resets, run finished after 652 ms. (steps per millisecond=145 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 102400 steps, including 202 resets, run finished after 685 ms. (steps per millisecond=149 ) properties seen :[0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 4557 steps, including 10 resets, run visited all 1 properties in 32 ms. (steps per millisecond=142 )
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ShieldPPPt-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098231300408"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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