Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857300503.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 374K Mar 5 18:22 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 FlexibleBarrier-PT-10b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678557453058

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 17:57:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 17:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 17:57:34] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-11 17:57:34] [INFO ] Transformed 1402 places.
[2023-03-11 17:57:34] [INFO ] Transformed 1613 transitions.
[2023-03-11 17:57:34] [INFO ] Found NUPN structural information;
[2023-03-11 17:57:34] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 131 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 15) seen :4
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-11 17:57:35] [INFO ] Computed 12 place invariants in 34 ms
[2023-03-11 17:57:36] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 17:57:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-11 17:57:38] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-11 17:57:39] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 11 ms to minimize.
[2023-03-11 17:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-11 17:57:40] [INFO ] Deduced a trap composed of 479 places in 431 ms of which 1 ms to minimize.
[2023-03-11 17:57:40] [INFO ] Deduced a trap composed of 481 places in 347 ms of which 2 ms to minimize.
[2023-03-11 17:57:41] [INFO ] Deduced a trap composed of 469 places in 325 ms of which 2 ms to minimize.
[2023-03-11 17:57:41] [INFO ] Deduced a trap composed of 447 places in 265 ms of which 0 ms to minimize.
[2023-03-11 17:57:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1621 ms
[2023-03-11 17:57:42] [INFO ] Deduced a trap composed of 445 places in 305 ms of which 1 ms to minimize.
[2023-03-11 17:57:42] [INFO ] Deduced a trap composed of 439 places in 271 ms of which 1 ms to minimize.
[2023-03-11 17:57:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2023-03-11 17:57:42] [INFO ] After 5257ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 755 ms.
[2023-03-11 17:57:43] [INFO ] After 7005ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 104 ms.
Support contains 45 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1077 edges and 1402 vertex of which 38 / 1402 are part of one of the 6 SCC in 6 ms
Free SCC test removed 32 places
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 258 place count 1370 transition count 1317
Reduce places removed 257 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 264 rules applied. Total rules applied 522 place count 1113 transition count 1310
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 529 place count 1106 transition count 1310
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 162 Pre rules applied. Total rules applied 529 place count 1106 transition count 1148
Deduced a syphon composed of 162 places in 1 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 853 place count 944 transition count 1148
Discarding 492 places :
Symmetric choice reduction at 3 with 492 rule applications. Total rules 1345 place count 452 transition count 656
Iterating global reduction 3 with 492 rules applied. Total rules applied 1837 place count 452 transition count 656
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1837 place count 452 transition count 648
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1853 place count 444 transition count 648
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 1924 place count 373 transition count 577
Iterating global reduction 3 with 71 rules applied. Total rules applied 1995 place count 373 transition count 577
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 2057 place count 373 transition count 515
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 2175 place count 314 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2183 place count 310 transition count 470
Free-agglomeration rule applied 69 times.
Iterating global reduction 4 with 69 rules applied. Total rules applied 2252 place count 310 transition count 401
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 2321 place count 241 transition count 401
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2323 place count 239 transition count 399
Iterating global reduction 5 with 2 rules applied. Total rules applied 2325 place count 239 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2327 place count 239 transition count 397
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 2333 place count 239 transition count 391
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2337 place count 239 transition count 391
Applied a total of 2337 rules in 257 ms. Remains 239 /1402 variables (removed 1163) and now considering 391/1613 (removed 1222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 239/1402 places, 391/1613 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 17:57:43] [INFO ] Flow matrix only has 378 transitions (discarded 13 similar events)
// Phase 1: matrix 378 rows 239 cols
[2023-03-11 17:57:43] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-11 17:57:44] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 17:57:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-11 17:57:44] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 17:57:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-11 17:57:44] [INFO ] After 78ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 17:57:44] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2023-03-11 17:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-11 17:57:44] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-11 17:57:44] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 391/391 transitions.
Graph (trivial) has 51 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 237 transition count 382
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 232 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 232 transition count 381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 231 transition count 381
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 23 place count 221 transition count 370
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 221 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 221 transition count 368
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 55 place count 211 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 211 transition count 356
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 62 place count 206 transition count 350
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 206 transition count 350
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 72 place count 206 transition count 345
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 206 transition count 343
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 94 place count 206 transition count 323
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 114 place count 186 transition count 323
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 120 place count 180 transition count 317
Iterating global reduction 6 with 6 rules applied. Total rules applied 126 place count 180 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 132 place count 180 transition count 311
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 180 transition count 311
Applied a total of 133 rules in 73 ms. Remains 180 /239 variables (removed 59) and now considering 311/391 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 180/239 places, 311/391 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 17:57:44] [INFO ] Flow matrix only has 296 transitions (discarded 15 similar events)
// Phase 1: matrix 296 rows 180 cols
[2023-03-11 17:57:44] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-11 17:57:44] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 17:57:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 17:57:45] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 17:57:45] [INFO ] After 54ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:45] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 17:57:45] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 19 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 311/311 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 180 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 178 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 178 transition count 309
Applied a total of 4 rules in 17 ms. Remains 178 /180 variables (removed 2) and now considering 309/311 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 178/180 places, 309/311 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 943208 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 943208 steps, saw 221043 distinct states, run finished after 3002 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 17:57:48] [INFO ] Flow matrix only has 294 transitions (discarded 15 similar events)
// Phase 1: matrix 294 rows 178 cols
[2023-03-11 17:57:48] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-11 17:57:48] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 17:57:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 17:57:48] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 17:57:48] [INFO ] After 48ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:48] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 17:57:48] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 19 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 309/309 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 178/178 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2023-03-11 17:57:48] [INFO ] Flow matrix only has 294 transitions (discarded 15 similar events)
[2023-03-11 17:57:48] [INFO ] Invariant cache hit.
[2023-03-11 17:57:48] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 17:57:48] [INFO ] Flow matrix only has 294 transitions (discarded 15 similar events)
[2023-03-11 17:57:48] [INFO ] Invariant cache hit.
[2023-03-11 17:57:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 17:57:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-11 17:57:49] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 17:57:49] [INFO ] Flow matrix only has 294 transitions (discarded 15 similar events)
[2023-03-11 17:57:49] [INFO ] Invariant cache hit.
[2023-03-11 17:57:49] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 178/178 places, 309/309 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 178 transition count 271
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 84 place count 155 transition count 248
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 118 place count 121 transition count 213
Iterating global reduction 2 with 34 rules applied. Total rules applied 152 place count 121 transition count 213
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 177 place count 121 transition count 188
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 121 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 121 transition count 187
Applied a total of 179 rules in 16 ms. Remains 121 /178 variables (removed 57) and now considering 187/309 (removed 122) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 121 cols
[2023-03-11 17:57:49] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 17:57:49] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 17:57:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-11 17:57:49] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:49] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 17:57:49] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 17:57:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-11 17:57:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 309 transitions and 1192 arcs took 3 ms.
[2023-03-11 17:57:49] [INFO ] Flatten gal took : 47 ms
Total runtime 15213 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_10b
(NrP: 178 NrTr: 309 NrArc: 1192)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.738sec


RS generation: 1m 8.491sec


-> reachability set: #nodes 57572 (5.8e+04) #states 939,644,375,041 (11)



starting MCC model checker
--------------------------

checking: EF [[[p177<=1 & 1<=p177] & [1<=p96 & p96<=1]]]
normalized: E [true U [[1<=p96 & p96<=1] & [p177<=1 & 1<=p177]]]

abstracting: (1<=p177)
states: 313,214,791,680 (11)
abstracting: (p177<=1)
states: 939,644,375,041 (11)
abstracting: (p96<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p96)
states: 104,404,930,560 (11)
MC time: 29m25.535sec

checking: AG [[[p53<=0 & 0<=p53] | [[[[[p83<=1 & 1<=p83] & [p124<=1 & 1<=p124]] & [p37<=1 & 1<=p37]] | [p85<=0 & 0<=p85]] & [[[[0<=p77 & p77<=0] | [0<=p74 & p74<=0]] | [[1<=p26 & p26<=1] | [1<=p20 & p20<=1]]] | [[[0<=p45 & p45<=0] | [0<=p159 & p159<=0]] | [[0<=p92 & p92<=0] | [[[1<=p13 & p13<=1] & [1<=p55 & p55<=1]] | [[0<=p76 & p76<=0] & [[1<=p174 & p174<=1] | [[p94<=1 & 1<=p94] & [p177<=1 & 1<=p177]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[p177<=1 & 1<=p177] & [p94<=1 & 1<=p94]] | [1<=p174 & p174<=1]] & [0<=p76 & p76<=0]] | [[1<=p55 & p55<=1] & [1<=p13 & p13<=1]]] | [0<=p92 & p92<=0]] | [[0<=p159 & p159<=0] | [0<=p45 & p45<=0]]] | [[[1<=p20 & p20<=1] | [1<=p26 & p26<=1]] | [[0<=p74 & p74<=0] | [0<=p77 & p77<=0]]]] & [[p85<=0 & 0<=p85] | [[p37<=1 & 1<=p37] & [[p124<=1 & 1<=p124] & [p83<=1 & 1<=p83]]]]] | [p53<=0 & 0<=p53]]]]]

abstracting: (0<=p53)
states: 939,644,375,041 (11)
abstracting: (p53<=0)
states: 835,239,444,481 (11)
abstracting: (1<=p83)
states: 104,404,930,560 (11)
abstracting: (p83<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p124)
states: 12,697,896,960 (10)
abstracting: (p124<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p37)
states: 52,202,465,280 (10)
abstracting: (p37<=1)
states: 939,644,375,041 (11)
abstracting: (0<=p85)
states: 939,644,375,041 (11)
abstracting: (p85<=0)
states: 822,188,828,161 (11)
abstracting: (p77<=0)
states: 835,239,444,481 (11)
abstracting: (0<=p77)
states: 939,644,375,041 (11)
abstracting: (p74<=0)
states: 805,409,464,321 (11)
abstracting: (0<=p74)
states: 939,644,375,041 (11)
abstracting: (p26<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p26)
states: 117,455,546,880 (11)
abstracting: (p20<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p20)
states: 46,982,218,752 (10)
abstracting: (p45<=0)
states: 887,441,909,761 (11)
abstracting: (0<=p45)
states: 939,644,375,041 (11)
abstracting: (p159<=0)
states: 926,946,478,081 (11)
abstracting: (0<=p159)
states: 939,644,375,041 (11)
abstracting: (p92<=0)
states: 835,239,444,481 (11)
abstracting: (0<=p92)
states: 939,644,375,041 (11)
abstracting: (p13<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p13)
states: 46,982,218,752 (10)
abstracting: (p55<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p55)
states: 104,404,930,560 (11)
abstracting: (p76<=0)
states: 835,239,444,481 (11)
abstracting: (0<=p76)
states: 939,644,375,041 (11)
abstracting: (p174<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p174)
states: 12,697,896,960 (10)
abstracting: (1<=p94)
states: 104,404,930,560 (11)
abstracting: (p94<=1)
states: 939,644,375,041 (11)
abstracting: (1<=p177)
states: 313,214,791,680 (11)
abstracting: (p177<=1)
states: 939,644,375,041 (11)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6636680 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097596 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

3826 14812
iterations count:214568 (694), effective:4801 (15)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 1764 sec

457563
sat_reach.icc:155: Timeout: after 882 sec

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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FlexibleBarrier-PT-10b, 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-tall-167838857300503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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