Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287300224.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PolyORBNT-PT-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287300224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 57K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 260K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 10K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 129K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Mar 22 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621388493408

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 01:41:36] [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-19 01:41:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 01:41:36] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2021-05-19 01:41:36] [INFO ] Transformed 349 places.
[2021-05-19 01:41:36] [INFO ] Transformed 1210 transitions.
[2021-05-19 01:41:36] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 234 ms.
[2021-05-19 01:41:36] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 685 resets, run finished after 153 ms. (steps per millisecond=65 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 150 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 165 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-19 01:41:37] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-19 01:41:37] [INFO ] Computed 62 place invariants in 45 ms
[2021-05-19 01:41:37] [INFO ] [Real]Absence check using 42 positive place invariants in 42 ms returned sat
[2021-05-19 01:41:37] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 26 ms returned unsat
[2021-05-19 01:41:38] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2021-05-19 01:41:38] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 18 ms returned sat
[2021-05-19 01:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:41:38] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2021-05-19 01:41:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 01:41:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 25 ms returned sat
[2021-05-19 01:41:38] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 19 ms returned sat
[2021-05-19 01:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 01:41:39] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-19 01:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 01:41:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 346 ms returned sat
[2021-05-19 01:41:39] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 33 ms.
[2021-05-19 01:41:40] [INFO ] Added : 34 causal constraints over 7 iterations in 972 ms. Result :sat
[2021-05-19 01:41:41] [INFO ] Deduced a trap composed of 209 places in 736 ms
[2021-05-19 01:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 955 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-19 01:41:41] [INFO ] [Real]Absence check using 42 positive place invariants in 54 ms returned sat
[2021-05-19 01:41:41] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 21 ms returned unsat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive place invariants in 55 ms returned sat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 31 ms returned unsat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned sat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned unsat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive place invariants in 124 ms returned sat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 43 ms returned unsat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive place invariants in 25 ms returned sat
[2021-05-19 01:41:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 53 ms returned sat
[2021-05-19 01:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:41:43] [INFO ] [Real]Absence check using state equation in 562 ms returned unsat
[2021-05-19 01:41:43] [INFO ] [Real]Absence check using 42 positive place invariants in 137 ms returned sat
[2021-05-19 01:41:43] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 53 ms returned unsat
[2021-05-19 01:41:43] [INFO ] [Real]Absence check using 42 positive place invariants in 179 ms returned sat
[2021-05-19 01:41:43] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 29 ms returned unsat
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 5300 steps, including 314 resets, run finished after 86 ms. (steps per millisecond=61 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 10 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 293 transition count 504
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 292 transition count 503
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 2 with 4 rules applied. Total rules applied 114 place count 290 transition count 501
Applied a total of 114 rules in 197 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2021-05-19 01:41:43] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2021-05-19 01:41:44] [INFO ] Computed 57 place invariants in 25 ms
[2021-05-19 01:41:45] [INFO ] Dead Transitions using invariants and state equation in 1121 ms returned [259, 261, 262, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 275, 276, 277, 278, 279, 280, 282, 283, 284, 287, 288, 289, 290, 291, 293, 294, 295, 296, 297, 298, 299, 300, 302, 303, 304, 305, 306, 307, 309, 310, 312, 313, 315, 317, 319, 320, 321, 322, 324, 325, 326, 327, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 341, 343, 345, 346, 347, 348, 349, 352, 353, 355, 356, 357, 358, 359, 361, 365, 368, 369, 370, 372, 374, 375, 376, 377, 378, 379, 380, 382, 383]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[383, 382, 380, 379, 378, 377, 376, 375, 374, 372, 370, 369, 368, 365, 361, 359, 358, 357, 356, 355, 353, 352, 349, 348, 347, 346, 345, 343, 341, 339, 338, 337, 336, 335, 334, 333, 332, 331, 330, 329, 327, 326, 325, 324, 322, 321, 320, 319, 317, 315, 313, 312, 310, 309, 307, 306, 305, 304, 303, 302, 300, 299, 298, 297, 296, 295, 294, 293, 291, 290, 289, 288, 287, 284, 283, 282, 280, 279, 278, 277, 276, 275, 273, 272, 271, 270, 269, 268, 267, 266, 265, 264, 262, 261, 259]
Starting structural reductions, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 290/349 places, 406/555 transitions.
Incomplete random walk after 1000000 steps, including 51904 resets, run finished after 2485 ms. (steps per millisecond=402 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7197 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties seen :[0]
Interrupted probabilistic random walk after 8117250 steps, run timeout after 30001 ms. (steps per millisecond=270 ) properties seen :[0]
Probabilistic random walk after 8117250 steps, saw 2285923 distinct states, run finished after 30007 ms. (steps per millisecond=270 ) properties seen :[0]
[2021-05-19 01:42:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 01:42:18] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-19 01:42:18] [INFO ] [Real]Absence check using 43 positive place invariants in 12 ms returned sat
[2021-05-19 01:42:18] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-19 01:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:42:18] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-19 01:42:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 01:42:19] [INFO ] [Nat]Absence check using 43 positive place invariants in 287 ms returned sat
[2021-05-19 01:42:19] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 109 ms returned sat
[2021-05-19 01:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 01:42:19] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-19 01:42:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 01:42:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2021-05-19 01:42:20] [INFO ] Deduced a trap composed of 92 places in 232 ms
[2021-05-19 01:42:20] [INFO ] Deduced a trap composed of 95 places in 116 ms
[2021-05-19 01:42:20] [INFO ] Deduced a trap composed of 103 places in 168 ms
[2021-05-19 01:42:20] [INFO ] Deduced a trap composed of 89 places in 165 ms
[2021-05-19 01:42:21] [INFO ] Deduced a trap composed of 102 places in 528 ms
[2021-05-19 01:42:21] [INFO ] Deduced a trap composed of 94 places in 80 ms
[2021-05-19 01:42:21] [INFO ] Deduced a trap composed of 96 places in 558 ms
[2021-05-19 01:42:22] [INFO ] Deduced a trap composed of 86 places in 95 ms
[2021-05-19 01:42:22] [INFO ] Deduced a trap composed of 93 places in 165 ms
[2021-05-19 01:42:22] [INFO ] Deduced a trap composed of 91 places in 191 ms
[2021-05-19 01:42:22] [INFO ] Deduced a trap composed of 93 places in 227 ms
[2021-05-19 01:42:23] [INFO ] Deduced a trap composed of 84 places in 251 ms
[2021-05-19 01:42:23] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2021-05-19 01:42:23] [INFO ] Deduced a trap composed of 95 places in 244 ms
[2021-05-19 01:42:23] [INFO ] Deduced a trap composed of 89 places in 136 ms
[2021-05-19 01:42:24] [INFO ] Deduced a trap composed of 95 places in 103 ms
[2021-05-19 01:42:24] [INFO ] Deduced a trap composed of 89 places in 174 ms
[2021-05-19 01:42:24] [INFO ] Deduced a trap composed of 92 places in 178 ms
[2021-05-19 01:42:25] [INFO ] Deduced a trap composed of 86 places in 176 ms
[2021-05-19 01:42:25] [INFO ] Deduced a trap composed of 89 places in 192 ms
[2021-05-19 01:42:26] [INFO ] Deduced a trap composed of 92 places in 92 ms
[2021-05-19 01:42:26] [INFO ] Deduced a trap composed of 97 places in 109 ms
[2021-05-19 01:42:28] [INFO ] Deduced a trap composed of 100 places in 252 ms
[2021-05-19 01:42:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 01:43:03] [INFO ] Deduced a trap composed of 7 places in 137 ms
[2021-05-19 01:43:04] [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: Stream closed (> (+ s0 s45 s70 s106 s158 s250 s277) 0)") while checking expression at index 0
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 13 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2021-05-19 01:43:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 01:43:04] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-19 01:43:04] [INFO ] Implicit Places using invariants in 632 ms returned []
[2021-05-19 01:43:04] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 01:43:04] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-19 01:43:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 01:43:07] [INFO ] Implicit Places using invariants and state equation in 2792 ms returned []
Implicit Place search using SMT with State Equation took 3424 ms to find 0 implicit places.
[2021-05-19 01:43:07] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-19 01:43:07] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 01:43:07] [INFO ] Computed 57 place invariants in 5 ms
[2021-05-19 01:43:08] [INFO ] Dead Transitions using invariants and state equation in 717 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5244 resets, run finished after 239 ms. (steps per millisecond=418 ) properties seen :[0]
[2021-05-19 01:43:08] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 01:43:08] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-19 01:43:08] [INFO ] [Real]Absence check using 43 positive place invariants in 12 ms returned sat
[2021-05-19 01:43:08] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 13 ms returned sat
[2021-05-19 01:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:43:08] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-19 01:43:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 01:43:08] [INFO ] [Nat]Absence check using 43 positive place invariants in 69 ms returned sat
[2021-05-19 01:43:08] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 17 ms returned sat
[2021-05-19 01:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 01:43:09] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-19 01:43:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 01:43:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2021-05-19 01:43:09] [INFO ] Deduced a trap composed of 92 places in 546 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 95 places in 165 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 103 places in 119 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 89 places in 89 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 102 places in 116 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 94 places in 117 ms
[2021-05-19 01:43:10] [INFO ] Deduced a trap composed of 96 places in 96 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 86 places in 97 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 93 places in 94 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 91 places in 97 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 93 places in 92 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 84 places in 93 ms
[2021-05-19 01:43:11] [INFO ] Deduced a trap composed of 93 places in 129 ms
[2021-05-19 01:43:12] [INFO ] Deduced a trap composed of 95 places in 91 ms
[2021-05-19 01:43:12] [INFO ] Deduced a trap composed of 89 places in 151 ms
[2021-05-19 01:43:12] [INFO ] Deduced a trap composed of 95 places in 111 ms
[2021-05-19 01:43:13] [INFO ] Deduced a trap composed of 89 places in 93 ms
[2021-05-19 01:43:13] [INFO ] Deduced a trap composed of 92 places in 96 ms
[2021-05-19 01:43:13] [INFO ] Deduced a trap composed of 86 places in 93 ms
[2021-05-19 01:43:14] [INFO ] Deduced a trap composed of 89 places in 106 ms
[2021-05-19 01:43:14] [INFO ] Deduced a trap composed of 92 places in 110 ms
[2021-05-19 01:43:14] [INFO ] Deduced a trap composed of 97 places in 94 ms
[2021-05-19 01:43:16] [INFO ] Deduced a trap composed of 100 places in 98 ms
[2021-05-19 01:43:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 01:43:28] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2021-05-19 01:43:28] [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: Stream closed (> (+ s0 s45 s70 s106 s158 s250 s277) 0)") while checking expression at index 0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 23 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
// Phase 1: matrix 395 rows 283 cols
[2021-05-19 01:43:29] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-19 01:43:29] [INFO ] [Real]Absence check using 44 positive place invariants in 18 ms returned sat
[2021-05-19 01:43:29] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 48 ms returned sat
[2021-05-19 01:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:43:29] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2021-05-19 01:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 01:43:29] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2021-05-19 01:43:29] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 8 ms returned sat
[2021-05-19 01:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 01:43:29] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 99 places in 100 ms
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 93 places in 121 ms
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 110 places in 140 ms
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 93 places in 127 ms
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 81 places in 118 ms
[2021-05-19 01:43:30] [INFO ] Deduced a trap composed of 87 places in 213 ms
[2021-05-19 01:43:31] [INFO ] Deduced a trap composed of 93 places in 103 ms
[2021-05-19 01:43:31] [INFO ] Deduced a trap composed of 81 places in 185 ms
[2021-05-19 01:43:31] [INFO ] Deduced a trap composed of 87 places in 140 ms
[2021-05-19 01:43:31] [INFO ] Deduced a trap composed of 81 places in 216 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 94 places in 100 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 84 places in 88 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 93 places in 93 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 87 places in 171 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 81 places in 86 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 90 places in 153 ms
[2021-05-19 01:43:32] [INFO ] Deduced a trap composed of 81 places in 97 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 85 places in 70 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 94 places in 89 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 81 places in 106 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 88 places in 109 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 84 places in 183 ms
[2021-05-19 01:43:33] [INFO ] Deduced a trap composed of 84 places in 170 ms
[2021-05-19 01:43:34] [INFO ] Deduced a trap composed of 84 places in 139 ms
[2021-05-19 01:43:34] [INFO ] Deduced a trap composed of 87 places in 110 ms
[2021-05-19 01:43:34] [INFO ] Deduced a trap composed of 84 places in 140 ms
[2021-05-19 01:43:34] [INFO ] Deduced a trap composed of 87 places in 92 ms
[2021-05-19 01:43:35] [INFO ] Deduced a trap composed of 96 places in 91 ms
[2021-05-19 01:43:35] [INFO ] Deduced a trap composed of 81 places in 85 ms
[2021-05-19 01:43:37] [INFO ] Deduced a trap composed of 90 places in 207 ms
[2021-05-19 01:43:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 01:44:14] [INFO ] Deduced a trap composed of 7 places in 195 ms
[2021-05-19 01:44:14] [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: Stream closed (> (+ s0 s44 s69 s104 s155 s245 s270) 0)") while checking expression at index 0
[2021-05-19 01:44:14] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2021-05-19 01:44:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2021-05-19 01:44:15] [INFO ] Flatten gal took : 115 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ PolyORBNT-PT-S05J20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ PolyORBNT-PT-S05J20

{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 01:44:15 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19136,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 ((4 <= p267)))",
"processed_size": 19,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2109,
"conflict_clusters": 30,
"places": 290,
"places_significant": 233,
"singleton_clusters": 0,
"transitions": 406
},
"task":
{
"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"
}
}
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: 696/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9280
lola: finding significant places
lola: 290 places, 406 transitions, 233 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 ReachabilityFireability.xml
lola: E (F ((4 <= p267)))
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 ((4 <= p267)))
lola: processed formula length: 19
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: subprocess will run for 0 seconds at most (--localtimelimit)
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: (4 <= p267)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 19136 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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 r170-oct2-162089287300224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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