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.r202-smll-167840348700458.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 HirschbergSinclair-PT-25, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.7K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-CTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678795917819

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 12:12:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:12:00] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-14 12:12:00] [INFO ] Transformed 600 places.
[2023-03-14 12:12:00] [INFO ] Transformed 545 transitions.
[2023-03-14 12:12:00] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 146 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 44 place count 556 transition count 526
Iterating global reduction 1 with 19 rules applied. Total rules applied 63 place count 556 transition count 526
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 545 transition count 515
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 545 transition count 515
Applied a total of 85 rules in 350 ms. Remains 545 /600 variables (removed 55) and now considering 515/545 (removed 30) transitions.
// Phase 1: matrix 515 rows 545 cols
[2023-03-14 12:12:01] [INFO ] Computed 30 place invariants in 49 ms
[2023-03-14 12:12:02] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-14 12:12:02] [INFO ] Invariant cache hit.
[2023-03-14 12:12:03] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2023-03-14 12:12:03] [INFO ] Invariant cache hit.
[2023-03-14 12:12:03] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 545/600 places, 515/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3168 ms. Remains : 545/600 places, 515/545 transitions.
Support contains 146 out of 545 places after structural reductions.
[2023-03-14 12:12:04] [INFO ] Flatten gal took : 101 ms
[2023-03-14 12:12:04] [INFO ] Flatten gal took : 54 ms
[2023-03-14 12:12:04] [INFO ] Input system was already deterministic with 515 transitions.
Support contains 134 out of 545 places (down from 146) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 791 ms. (steps per millisecond=12 ) properties (out of 89) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-14 12:12:05] [INFO ] Invariant cache hit.
[2023-03-14 12:12:06] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 125 ms returned sat
[2023-03-14 12:12:07] [INFO ] After 964ms SMT Verify possible using state equation in real domain returned unsat :3 sat :3 real:5
[2023-03-14 12:12:07] [INFO ] After 1281ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-14 12:12:07] [INFO ] After 1981ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:8
[2023-03-14 12:12:08] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 82 ms returned sat
[2023-03-14 12:12:09] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-14 12:12:09] [INFO ] After 1590ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-14 12:12:10] [INFO ] After 2485ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 20 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 515/515 transitions.
Graph (complete) has 1025 edges and 545 vertex of which 543 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 166 rules applied. Total rules applied 167 place count 543 transition count 349
Reduce places removed 164 places and 0 transitions.
Graph (complete) has 673 edges and 379 vertex of which 348 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 165 rules applied. Total rules applied 332 place count 348 transition count 349
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 363 place count 348 transition count 318
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 370 place count 341 transition count 311
Iterating global reduction 3 with 7 rules applied. Total rules applied 377 place count 341 transition count 311
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 381 place count 341 transition count 307
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 601 edges and 337 vertex of which 332 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 386 place count 332 transition count 307
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 391 place count 332 transition count 302
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 396 place count 327 transition count 297
Iterating global reduction 6 with 5 rules applied. Total rules applied 401 place count 327 transition count 297
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 404 place count 324 transition count 294
Iterating global reduction 6 with 3 rules applied. Total rules applied 407 place count 324 transition count 294
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 428 place count 324 transition count 273
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 449 place count 303 transition count 273
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 466 place count 286 transition count 256
Applied a total of 466 rules in 152 ms. Remains 286 /545 variables (removed 259) and now considering 256/515 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 286/545 places, 256/515 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 256 rows 286 cols
[2023-03-14 12:12:11] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-14 12:12:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-14 12:12:11] [INFO ] [Real]Absence check using 2 positive and 28 generalized place invariants in 63 ms returned sat
[2023-03-14 12:12:11] [INFO ] After 203ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-14 12:12:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-14 12:12:11] [INFO ] After 51ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :2 sat :1
[2023-03-14 12:12:11] [INFO ] After 90ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-14 12:12:11] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-14 12:12:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:12:12] [INFO ] [Nat]Absence check using 2 positive and 28 generalized place invariants in 42 ms returned sat
[2023-03-14 12:12:12] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-14 12:12:12] [INFO ] After 38ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-14 12:12:12] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-14 12:12:12] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 256/256 transitions.
Graph (complete) has 524 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 278 transition count 204
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 302 edges and 219 vertex of which 134 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 53 output transitions
Drop transitions removed 53 transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 81 rules applied. Total rules applied 134 place count 134 transition count 130
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 184 place count 114 transition count 100
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 184 place count 114 transition count 71
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 242 place count 85 transition count 71
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 82 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 82 transition count 68
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 251 place count 82 transition count 65
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 126 edges and 79 vertex of which 74 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 255 place count 74 transition count 65
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 260 place count 74 transition count 60
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 268 place count 66 transition count 52
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 6 with 34 rules applied. Total rules applied 302 place count 58 transition count 26
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 328 place count 32 transition count 26
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 328 place count 32 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 346 place count 23 transition count 17
Applied a total of 346 rules in 36 ms. Remains 23 /286 variables (removed 263) and now considering 17/256 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 23/286 places, 17/256 transitions.
Incomplete random walk after 10000 steps, including 555 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 124 steps, run visited all 1 properties in 8 ms. (steps per millisecond=15 )
Probabilistic random walk after 124 steps, saw 55 distinct states, run finished after 9 ms. (steps per millisecond=13 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 38 ms
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 39 ms
[2023-03-14 12:12:12] [INFO ] Input system was already deterministic with 515 transitions.
Support contains 123 out of 545 places (down from 124) after GAL structural reductions.
Computed a total of 545 stabilizing places and 515 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 545 transition count 515
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 520 transition count 273
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 303 transition count 273
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 447 place count 290 transition count 260
Iterating global reduction 2 with 13 rules applied. Total rules applied 460 place count 290 transition count 260
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 468 place count 290 transition count 252
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 476 place count 282 transition count 252
Applied a total of 476 rules in 46 ms. Remains 282 /545 variables (removed 263) and now considering 252/515 (removed 263) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 282/545 places, 252/515 transitions.
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 13 ms
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 17 ms
[2023-03-14 12:12:12] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 534 transition count 504
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 534 transition count 504
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 529 transition count 499
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 529 transition count 499
Applied a total of 32 rules in 63 ms. Remains 529 /545 variables (removed 16) and now considering 499/515 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 529/545 places, 499/515 transitions.
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 29 ms
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 32 ms
[2023-03-14 12:12:12] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 520 transition count 273
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 303 transition count 273
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 448 place count 289 transition count 259
Iterating global reduction 2 with 14 rules applied. Total rules applied 462 place count 289 transition count 259
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 470 place count 289 transition count 251
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 478 place count 281 transition count 251
Applied a total of 478 rules in 49 ms. Remains 281 /545 variables (removed 264) and now considering 251/515 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 281/545 places, 251/515 transitions.
[2023-03-14 12:12:12] [INFO ] Flatten gal took : 12 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 14 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 251 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 522 transition count 284
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 314 transition count 284
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 430 place count 300 transition count 270
Iterating global reduction 2 with 14 rules applied. Total rules applied 444 place count 300 transition count 270
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 452 place count 300 transition count 262
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 460 place count 292 transition count 262
Applied a total of 460 rules in 38 ms. Remains 292 /545 variables (removed 253) and now considering 262/515 (removed 253) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 292/545 places, 262/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 12 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 13 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 531 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 531 transition count 501
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 525 transition count 495
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 525 transition count 495
Applied a total of 40 rules in 60 ms. Remains 525 /545 variables (removed 20) and now considering 495/515 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 525/545 places, 495/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 23 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 24 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 520 transition count 274
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 304 transition count 274
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 446 place count 290 transition count 260
Iterating global reduction 2 with 14 rules applied. Total rules applied 460 place count 290 transition count 260
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 468 place count 290 transition count 252
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 476 place count 282 transition count 252
Applied a total of 476 rules in 41 ms. Remains 282 /545 variables (removed 263) and now considering 252/515 (removed 263) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 282/545 places, 252/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 12 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 13 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 532 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 532 transition count 502
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 526 transition count 496
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 526 transition count 496
Applied a total of 38 rules in 52 ms. Remains 526 /545 variables (removed 19) and now considering 496/515 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 526/545 places, 496/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 22 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 25 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 496 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 531 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 531 transition count 501
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 525 transition count 495
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 525 transition count 495
Applied a total of 40 rules in 50 ms. Remains 525 /545 variables (removed 20) and now considering 495/515 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 525/545 places, 495/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 22 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 23 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 533 transition count 503
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 533 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 529 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 529 transition count 499
Applied a total of 32 rules in 48 ms. Remains 529 /545 variables (removed 16) and now considering 499/515 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 529/545 places, 499/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 20 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 21 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 532 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 532 transition count 502
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 526 transition count 496
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 526 transition count 496
Applied a total of 38 rules in 52 ms. Remains 526 /545 variables (removed 19) and now considering 496/515 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 526/545 places, 496/515 transitions.
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 18 ms
[2023-03-14 12:12:13] [INFO ] Flatten gal took : 19 ms
[2023-03-14 12:12:13] [INFO ] Input system was already deterministic with 496 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 524 transition count 309
Reduce places removed 185 places and 0 transitions.
Iterating post reduction 1 with 185 rules applied. Total rules applied 370 place count 339 transition count 309
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 382 place count 327 transition count 297
Iterating global reduction 2 with 12 rules applied. Total rules applied 394 place count 327 transition count 297
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 400 place count 327 transition count 291
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 406 place count 321 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 407 place count 320 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 320 transition count 290
Applied a total of 408 rules in 42 ms. Remains 320 /545 variables (removed 225) and now considering 290/515 (removed 225) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 320/545 places, 290/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 15 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 11 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 531 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 531 transition count 501
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 525 transition count 495
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 525 transition count 495
Applied a total of 40 rules in 53 ms. Remains 525 /545 variables (removed 20) and now considering 495/515 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 525/545 places, 495/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 18 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 18 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 535 transition count 505
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 535 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 532 transition count 502
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 532 transition count 502
Applied a total of 26 rules in 54 ms. Remains 532 /545 variables (removed 13) and now considering 502/515 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 532/545 places, 502/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 17 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 18 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 532 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 532 transition count 502
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 527 transition count 497
Applied a total of 36 rules in 47 ms. Remains 527 /545 variables (removed 18) and now considering 497/515 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 527/545 places, 497/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 16 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 17 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 520 transition count 273
Reduce places removed 217 places and 0 transitions.
Iterating post reduction 1 with 217 rules applied. Total rules applied 434 place count 303 transition count 273
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 448 place count 289 transition count 259
Iterating global reduction 2 with 14 rules applied. Total rules applied 462 place count 289 transition count 259
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 470 place count 289 transition count 251
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 478 place count 281 transition count 251
Applied a total of 478 rules in 27 ms. Remains 281 /545 variables (removed 264) and now considering 251/515 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 281/545 places, 251/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 7 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 8 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 251 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA HirschbergSinclair-PT-25-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 515/515 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 532 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 532 transition count 502
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 526 transition count 496
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 526 transition count 496
Applied a total of 38 rules in 47 ms. Remains 526 /545 variables (removed 19) and now considering 496/515 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 526/545 places, 496/515 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 16 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 17 ms
[2023-03-14 12:12:14] [INFO ] Input system was already deterministic with 496 transitions.
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 19 ms
[2023-03-14 12:12:14] [INFO ] Flatten gal took : 20 ms
[2023-03-14 12:12:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-14 12:12:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 545 places, 515 transitions and 1544 arcs took 5 ms.
Total runtime 14495 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 545 NrTr: 515 NrArc: 1544)

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

net check time: 0m 0.000sec

init dd package: 0m 3.406sec


RS generation: 0m20.778sec


-> reachability set: #nodes 126517 (1.3e+05) #states 49,820,358,848,826,184,164,931,448,905 (28)



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

checking: AF [AG [AF [1<=p125]]]
normalized: ~ [EG [E [true U EG [~ [1<=p125]]]]]

abstracting: (1<=p125)
states: 11,679,692,520,513,720,124,317,930,666 (28)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-25-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.390sec

checking: AG [EF [EG [1<=p467]]]
normalized: ~ [E [true U ~ [E [true U EG [1<=p467]]]]]

abstracting: (1<=p467)
states: 200,884,686,582,394,431,158,042,624 (26)
.......................................................
before gc: list nodes free: 1155170

after gc: idd nodes used:668232, unused:63331768; list nodes free:259291111
.......................................................................................................................................................
EG iterations: 206

before gc: list nodes free: 1676226

after gc: idd nodes used:168949, unused:63831051; list nodes free:265646604
MC time: 4m13.008sec

checking: AG [EF [[1<=p423 & AF [1<=p465]]]]
normalized: ~ [E [true U ~ [E [true U [1<=p423 & ~ [EG [~ [1<=p465]]]]]]]]

abstracting: (1<=p465)
states: 201,774,401,340,646,475,111,444,608 (26)
.
EG iterations: 1
abstracting: (1<=p423)
states: 236,913,710,670,631,084,126,353,152 (26)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-25-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.817sec

checking: EF [[~ [E [[1<=p27 & 1<=p116] U 1<=p216]] & 1<=p360]]
normalized: E [true U [1<=p360 & ~ [E [[1<=p27 & 1<=p116] U 1<=p216]]]]

abstracting: (1<=p216)
states: 71,308,052,920,580,206,367,945,600 (25)
abstracting: (1<=p116)
states: 12,132,200,891,013,330,742,629,410,197 (28)
abstracting: (1<=p27)
states: 25,889,480,338,058,859,361,794,627,310 (28)
abstracting: (1<=p360)
states: 256,970,846,387,819,926,730,704,896 (26)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-25-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.183sec

checking: EX [AG [[AG [[p3<=0 | p185<=0]] & [A [AX [[1<=p5 & 1<=p263]] U p115<=0] | EX [EF [1<=p469]]]]]]
normalized: EX [~ [E [true U ~ [[[EX [E [true U 1<=p469]] | [~ [EG [~ [p115<=0]]] & ~ [E [~ [p115<=0] U [EX [~ [[1<=p5 & 1<=p263]]] & ~ [p115<=0]]]]]] & ~ [E [true U ~ [[p3<=0 | p185<=0]]]]]]]]]

abstracting: (p185<=0)
states: 49,733,203,841,586,750,685,217,455,969 (28)
abstracting: (p3<=0)
states: 24,765,049,616,979,406,829,474,629,165 (28)
abstracting: (p115<=0)
states: 38,612,109,312,274,412,933,425,478,584 (28)
abstracting: (1<=p263)
states: 283,302,097,400,665,486,241,911,808 (26)
abstracting: (1<=p5)
states: 25,190,019,066,363,116,050,031,768,748 (28)
.abstracting: (p115<=0)
states: 38,612,109,312,274,412,933,425,478,584 (28)
abstracting: (p115<=0)
states: 38,612,109,312,274,412,933,425,478,584 (28)
..............
before gc: list nodes free: 947741

after gc: idd nodes used:1245867, unused:62754133; list nodes free:265313475
......
before gc: list nodes free: 1482480

after gc: idd nodes used:1726894, unused:62273106; list nodes free:269485221
.MC time: 4m30.331sec

checking: [EX [[1<=p43 & 1<=p148]] | EG [[E [[1<=p38 & 1<=p26] U EF [1<=p370]] | [1<=p41 & 1<=p298]]]]
normalized: [EG [[[1<=p41 & 1<=p298] | E [[1<=p38 & 1<=p26] U E [true U 1<=p370]]]] | EX [[1<=p43 & 1<=p148]]]

abstracting: (1<=p148)
states: 20,438,784,293,663,669,651,366,558,414 (28)
abstracting: (1<=p43)
states: 24,787,242,098,841,130,172,794,513,311 (28)
.abstracting: (1<=p370)
states: 253,205,074,240,451,815,370,095,872 (26)
abstracting: (1<=p26)
states: 143,070,274,274,827,241,837,651,806 (26)
abstracting: (1<=p38)
states: 53,279,776,690,157,020,648,336,035 (25)
abstracting: (1<=p298)
states: 498,369,450,197,662,169,881,438,080 (26)
abstracting: (1<=p41)
states: 24,915,908,036,970,023,527,977,614,176 (28)
.....................
before gc: list nodes free: 1547156

after gc: idd nodes used:1215128, unused:62784872; list nodes free:271718718
..................
before gc: list nodes free: 1859169

after gc: idd nodes used:1684905, unused:62315095; list nodes free:275982484
MC time: 4m 7.003sec

checking: EX [[~ [E [AG [[1<=p41 & 1<=p428]] U [1<=p41 & 1<=p298]]] & [AG [AF [[p9<=0 | p539<=0]]] & [EF [1<=p123] | AX [1<=p301]]]]]
normalized: EX [[[[~ [EX [~ [1<=p301]]] | E [true U 1<=p123]] & ~ [E [true U EG [~ [[p9<=0 | p539<=0]]]]]] & ~ [E [~ [E [true U ~ [[1<=p41 & 1<=p428]]]] U [1<=p41 & 1<=p298]]]]]

abstracting: (1<=p298)
states: 498,369,450,197,662,169,881,438,080 (26)
abstracting: (1<=p41)
states: 24,915,908,036,970,023,527,977,614,176 (28)
abstracting: (1<=p428)
states: 392,960,870,137,881,948,831,023,616 (26)
abstracting: (1<=p41)
states: 24,915,908,036,970,023,527,977,614,176 (28)
abstracting: (p539<=0)
states: 49,820,357,578,753,052,964,931,448,905 (28)
abstracting: (p9<=0)
states: 25,052,650,371,218,619,753,774,417,761 (28)
....................................
EG iterations: 36
abstracting: (1<=p123)
states: 8,510,900,473,958,898,977,684,742,434 (27)
abstracting: (1<=p301)
states: 264,392,467,333,421,412,177,641,728 (26)
..-> the formula is TRUE

FORMULA HirschbergSinclair-PT-25-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.433sec

checking: AG [[E [1<=p257 U [EF [[1<=p519 & [1<=p45 & 1<=p157]]] | [1<=p21 & 1<=p94]]] | [1<=p49 & 1<=p419]]]
normalized: ~ [E [true U ~ [[E [1<=p257 U [[1<=p21 & 1<=p94] | E [true U [1<=p519 & [1<=p45 & 1<=p157]]]]] | [1<=p49 & 1<=p419]]]]]

abstracting: (1<=p419)
states: 482,089,545,417,323,654,605,181,952 (26)
abstracting: (1<=p49)
states: 24,212,739,553,164,667,881,918,539,273 (28)
abstracting: (1<=p157)
states: 12,958,352,049,581,116,794,889,155,288 (28)
abstracting: (1<=p45)
states: 23,831,339,686,624,441,008,009,285,025 (28)
abstracting: (1<=p519)
states: 236,913,710,670,631,084,126,353,152 (26)
abstracting: (1<=p94)
states: 20,410,242,434,370,283,143,307,761,390 (28)
abstracting: (1<=p21)
states: 24,897,821,932,966,166,911,059,427,646 (28)
abstracting: (1<=p257)
states: 134,267,105,079,585,413,879,041,920 (26)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-25-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.456sec

checking: [EG [AG [[[[p272<=0 & [p23<=0 | p494<=0]] | ~ [A [[1<=p3 & 1<=p59] U 1<=p429]]] & AX [[p47<=0 | p422<=0]]]]] | EF [[1<=p37 & 1<=p525]]]
normalized: [E [true U [1<=p37 & 1<=p525]] | EG [~ [E [true U ~ [[~ [EX [~ [[p47<=0 | p422<=0]]]] & [~ [[~ [EG [~ [1<=p429]]] & ~ [E [~ [1<=p429] U [~ [[1<=p3 & 1<=p59]] & ~ [1<=p429]]]]]] | [p272<=0 & [p23<=0 | p494<=0]]]]]]]]]

abstracting: (p494<=0)
states: 49,427,397,978,688,302,216,100,425,289 (28)
abstracting: (p23<=0)
states: 24,666,276,599,766,031,085,551,038,943 (28)
abstracting: (p272<=0)
states: 49,680,617,923,781,446,024,076,260,681 (28)
abstracting: (1<=p429)
states: 198,776,288,934,380,857,586,771,968 (26)
abstracting: (1<=p59)
states: 12,884,778,267,541,309,780,798,030,315 (28)
abstracting: (1<=p3)
states: 25,055,309,231,846,777,335,456,819,740 (28)
abstracting: (1<=p429)
states: 198,776,288,934,380,857,586,771,968 (26)
abstracting: (1<=p429)
states: 198,776,288,934,380,857,586,771,968 (26)
.
EG iterations: 1
abstracting: (p422<=0)
states: 49,427,397,978,688,302,216,100,425,289 (28)
abstracting: (p47<=0)
states: 20,014,917,299,748,328,866,614,703,143 (28)
..
EG iterations: 1
abstracting: (1<=p525)
states: 28,571,506,869,060,583,259,627,520 (25)
abstracting: (1<=p37)
states: 24,780,026,638,070,830,282,926,152,921 (28)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-25-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.259sec

checking: [E [AF [[EX [[[1<=p3 & 1<=p52] & [1<=p21 & 1<=p318]]] | AG [EF [1<=p146]]]] U AF [EX [[p270<=0 & 1<=p431]]]] | EG [A [[1<=p207 | 1<=p517] U AX [1<=p431]]]]
normalized: [EG [[~ [EG [EX [~ [1<=p431]]]] & ~ [E [EX [~ [1<=p431]] U [~ [[1<=p207 | 1<=p517]] & EX [~ [1<=p431]]]]]]] | E [~ [EG [~ [[~ [E [true U ~ [E [true U 1<=p146]]]] | EX [[[1<=p21 & 1<=p318] & [1<=p3 & 1<=p52]]]]]]] U ~ [EG [~ [EX [[p270<=0 & 1<=p431]]]]]]]

abstracting: (1<=p431)
states: 205,224,092,672,644,464,713,220,608 (26)
abstracting: (p270<=0)
states: 49,678,946,469,098,475,615,586,159,945 (28)
......
before gc: list nodes free: 15747643

after gc: idd nodes used:1585938, unused:62414062; list nodes free:276600879
...........................
before gc: list nodes free: 7839190

after gc: idd nodes used:2257609, unused:61742391; list nodes free:273690294
...MC time: 4m42.003sec

checking: [EG [[AG [[p41<=0 | [p147<=0 | p439<=0]]] & [AG [[1<=p325 | [1<=p29 & 1<=p440]]] | EX [[p47<=0 | p164<=0]]]]] | [EG [EF [[p15<=0 | p273<=0]]] | EX [1<=p188]]]
normalized: [[EX [1<=p188] | EG [E [true U [p15<=0 | p273<=0]]]] | EG [[[EX [[p47<=0 | p164<=0]] | ~ [E [true U ~ [[1<=p325 | [1<=p29 & 1<=p440]]]]]] & ~ [E [true U ~ [[p41<=0 | [p147<=0 | p439<=0]]]]]]]]

abstracting: (p439<=0)
states: 49,612,360,281,596,037,141,144,653,385 (28)
abstracting: (p147<=0)
states: 37,005,425,058,707,540,731,452,693,933 (28)
abstracting: (p41<=0)
states: 24,904,450,811,856,160,636,953,834,729 (28)
abstracting: (1<=p440)
states: 392,960,870,137,881,948,831,023,616 (26)
abstracting: (1<=p29)
states: 22,509,723,032,353,240,846,509,071,725 (28)
abstracting: (1<=p325)
states: 251,198,330,485,031,785,532,516,352 (26)
abstracting: (p164<=0)
states: 49,766,240,416,778,710,111,802,247,670 (28)
abstracting: (p47<=0)
states: 20,014,917,299,748,328,866,614,703,143 (28)

before gc: list nodes free: 12902181

after gc: idd nodes used:1654071, unused:62345929; list nodes free:276362610
.................................MC time: 4m11.032sec

checking: A [AX [A [~ [[[[1<=p45 & 1<=p176] | [1<=p7 & 1<=p363]] | [[1<=p37 & 1<=p342] | [1<=p31 & 1<=p528]]]] U 1<=p205]] U [1<=p39 & 1<=p510]]
normalized: [~ [EG [~ [[1<=p39 & 1<=p510]]]] & ~ [E [~ [[1<=p39 & 1<=p510]] U [EX [~ [[~ [EG [~ [1<=p205]]] & ~ [E [~ [1<=p205] U [[[[1<=p31 & 1<=p528] | [1<=p37 & 1<=p342]] | [[1<=p7 & 1<=p363] | [1<=p45 & 1<=p176]]] & ~ [1<=p205]]]]]]] & ~ [[1<=p39 & 1<=p510]]]]]]

abstracting: (1<=p510)
states: 392,960,870,137,881,948,831,023,616 (26)
abstracting: (1<=p39)
states: 25,720,491,125,652,448,743,805,712,934 (28)
abstracting: (1<=p205)
states: 99,048,252,007,736,606,956,792,320 (25)
abstracting: (1<=p176)
states: 90,675,347,478,184,136,890,595,040 (25)
abstracting: (1<=p45)
states: 23,831,339,686,624,441,008,009,285,025 (28)
abstracting: (1<=p363)
states: 495,912,696,079,941,329,710,701,824 (26)
abstracting: (1<=p7)
states: 22,549,217,391,622,233,544,819,604,129 (28)
abstracting: (1<=p342)
states: 484,527,191,569,649,412,302,446,592 (26)
abstracting: (1<=p37)
states: 24,780,026,638,070,830,282,926,152,921 (28)
abstracting: (1<=p528)
states: 3,210,513,662,080,931,051,520,000 (24)
abstracting: (1<=p31)
states: 26,045,259,782,484,023,106,878,295,122 (28)
abstracting: (1<=p205)
states: 99,048,252,007,736,606,956,792,320 (25)

before gc: list nodes free: 20419478

after gc: idd nodes used:1707038, unused:62292962; list nodes free:276141665
abstracting: (1<=p205)
states: 99,048,252,007,736,606,956,792,320 (25)
..............................................
before gc: list nodes free: 9913734

after gc: idd nodes used:2718722, unused:61281278; list nodes free:271827605
MC time: 3m43.048sec

checking: E [[1<=p35 & 1<=p134] U [EF [[~ [[[1<=p49 & 1<=p180] | 1<=p307]] & ~ [[EF [1<=p280] | AX [1<=p163]]]]] & [AF [~ [EX [[1<=p1 & 1<=p417]]]] | [~ [AF [[[1<=p3 & 1<=p359] | 1<=p485]]] | E [[EG [[1<=p23 & 1<=p99]] & 1<=p396] U [[[1<=p1 & 1<=p209] & [1<=p1 & 1<=p543]] | p222<=0]]]]]]
normalized: E [[1<=p35 & 1<=p134] U [[[E [[1<=p396 & EG [[1<=p23 & 1<=p99]]] U [p222<=0 | [[1<=p1 & 1<=p543] & [1<=p1 & 1<=p209]]]] | EG [~ [[1<=p485 | [1<=p3 & 1<=p359]]]]] | ~ [EG [EX [[1<=p1 & 1<=p417]]]]] & E [true U [~ [[~ [EX [~ [1<=p163]]] | E [true U 1<=p280]]] & ~ [[1<=p307 | [1<=p49 & 1<=p180]]]]]]]

abstracting: (1<=p180)
states: 89,840,119,125,997,265,329,950,560 (25)
abstracting: (1<=p49)
states: 24,212,739,553,164,667,881,918,539,273 (28)
abstracting: (1<=p307)
states: 240,037,497,504,268,245,106,497,536 (26)
abstracting: (1<=p280)
states: 137,867,395,288,535,512,091,236,608 (26)
abstracting: (1<=p163)
states: 12,105,737,780,605,792,263,563,000,599 (28)
.abstracting: (1<=p417)
states: 482,089,545,417,323,654,605,181,952 (26)
abstracting: (1<=p1)
states: 36,483,175,108,672,018,405,808,478,192 (28)
.............................................................................
before gc: list nodes free: 15568905

after gc: idd nodes used:2444764, unused:61555236; list nodes free:273025628
MC time: 3m18.015sec

checking: E [[~ [AG [AX [[1<=p47 & 1<=p352]]]] | [EF [[1<=p11 & 1<=p538]] | 1<=p451]] U [A [[~ [AF [1<=p127]] | AG [[1<=p109 & 1<=p420]]] U [[AG [1<=p337] & [AX [[1<=p7 & 1<=p540]] | [1<=p439 & [1<=p45 & 1<=p521]]]] & [AF [[1<=p85 | [1<=p19 & 1<=p399]]] & [1<=p22 & 1<=p167]]]] | [1<=p11 & 1<=p538]]]
normalized: E [[[1<=p451 | E [true U [1<=p11 & 1<=p538]]] | E [true U EX [~ [[1<=p47 & 1<=p352]]]]] U [[1<=p11 & 1<=p538] | [~ [EG [~ [[[[1<=p22 & 1<=p167] & ~ [EG [~ [[1<=p85 | [1<=p19 & 1<=p399]]]]]] & [[[1<=p439 & [1<=p45 & 1<=p521]] | ~ [EX [~ [[1<=p7 & 1<=p540]]]]] & ~ [E [true U ~ [1<=p337]]]]]]]] & ~ [E [~ [[[[1<=p22 & 1<=p167] & ~ [EG [~ [[1<=p85 | [1<=p19 & 1<=p399]]]]]] & [[[1<=p439 & [1<=p45 & 1<=p521]] | ~ [EX [~ [[1<=p7 & 1<=p540]]]]] & ~ [E [true U ~ [1<=p337]]]]]] U [~ [[~ [E [true U ~ [[1<=p109 & 1<=p420]]]] | EG [~ [1<=p127]]]] & ~ [[[[1<=p22 & 1<=p167] & ~ [EG [~ [[1<=p85 | [1<=p19 & 1<=p399]]]]]] & [[[1<=p439 & [1<=p45 & 1<=p521]] | ~ [EX [~ [[1<=p7 & 1<=p540]]]]] & ~ [E [true U ~ [1<=p337]]]]]]]]]]]]

abstracting: (1<=p337)
states: 257,219,265,153,899,309,724,243,968 (26)
abstracting: (1<=p540)
states: 629,282,831,040,000,000,000 (20)
abstracting: (1<=p7)
states: 22,549,217,391,622,233,544,819,604,129 (28)
.abstracting: (1<=p521)
states: 458,404,281,156,773,448,065,808,384 (26)
abstracting: (1<=p45)
states: 23,831,339,686,624,441,008,009,285,025 (28)
abstracting: (1<=p439)
states: 207,998,567,230,147,023,786,795,520 (26)
abstracting: (1<=p399)
states: 482,089,545,417,323,654,605,181,952 (26)
abstracting: (1<=p19)
states: 25,599,027,571,769,634,503,242,771,803 (28)
abstracting: (1<=p85)
states: 11,277,040,571,839,434,077,649,483,451 (28)
....................
before gc: list nodes free: 7923955

after gc: idd nodes used:2568629, unused:61431371; list nodes free:272501288
MC time: 2m56.086sec

checking: [A [[[A [[1<=p41 & 1<=p198] U [1<=p21 & 1<=p318]] & [AX [[1<=p15 & 1<=p486]] | [EX [[1<=p5 & 1<=p213]] & [1<=p35 & 1<=p130]]]] & [AX [1<=p165] & [1<=p394 & 1<=p297]]] U AX [1<=0]] | [AG [[[AF [[p27<=0 | p530<=0]] & [1<=p33 & 1<=p128]] | [A [[1<=p107 & [1<=p45 & 1<=p157]] U ~ [[1<=p19 & 1<=p399]]] | EX [A [1<=p364 U 1<=p97]]]]] | [E [[[[1<=p473 | EG [[1<=p27 & 1<=p383]]] & AX [[1<=p17 & 1<=p88]]] | EX [A [[1<=p43 & 1<=p296] U 1<=p435]]] U AG [AF [1<=p115]]] & EG [[EG [[1<=p14 & [1<=p5 & 1<=p61]]] | [AG [[1<=p9 & 1<=p409]] & [p60<=0 & p491<=0]]]]]]]
normalized: [[[EG [[[[p60<=0 & p491<=0] & ~ [E [true U ~ [[1<=p9 & 1<=p409]]]]] | EG [[1<=p14 & [1<=p5 & 1<=p61]]]]] & E [[EX [[~ [EG [~ [1<=p435]]] & ~ [E [~ [1<=p435] U [~ [[1<=p43 & 1<=p296]] & ~ [1<=p435]]]]]] | [~ [EX [~ [[1<=p17 & 1<=p88]]]] & [1<=p473 | EG [[1<=p27 & 1<=p383]]]]] U ~ [E [true U EG [~ [1<=p115]]]]]] | ~ [E [true U ~ [[[EX [[~ [EG [~ [1<=p97]]] & ~ [E [~ [1<=p97] U [~ [1<=p364] & ~ [1<=p97]]]]]] | [~ [EG [[1<=p19 & 1<=p399]]] & ~ [E [[1<=p19 & 1<=p399] U [~ [[1<=p107 & [1<=p45 & 1<=p157]]] & [1<=p19 & 1<=p399]]]]]] | [[1<=p33 & 1<=p128] & ~ [EG [~ [[p27<=0 | p530<=0]]]]]]]]]] | [~ [EG [EX [~ [1<=0]]]] & ~ [E [EX [~ [1<=0]] U [~ [[[[1<=p394 & 1<=p297] & ~ [EX [~ [1<=p165]]]] & [[[[1<=p35 & 1<=p130] & EX [[1<=p5 & 1<=p213]]] | ~ [EX [~ [[1<=p15 & 1<=p486]]]]] & [~ [EG [~ [[1<=p21 & 1<=p318]]]] & ~ [E [~ [[1<=p21 & 1<=p318]] U [~ [[1<=p41 & 1<=p198]] & ~ [[1<=p21 & 1<=p318]]]]]]]]] & EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p318)
states: 488,535,139,932,497,039,070,813,696 (26)
abstracting: (1<=p21)
states: 24,897,821,932,966,166,911,059,427,646 (28)
abstracting: (1<=p198)
states: 157,877,636,659,682,082,761,820,480 (26)
abstracting: (1<=p41)
states: 24,915,908,036,970,023,527,977,614,176 (28)
abstracting: (1<=p318)
states: 488,535,139,932,497,039,070,813,696 (26)
abstracting: (1<=p21)
states: 24,897,821,932,966,166,911,059,427,646 (28)
abstracting: (1<=p318)
states: 488,535,139,932,497,039,070,813,696 (26)
abstracting: (1<=p21)
states: 24,897,821,932,966,166,911,059,427,646 (28)
................
before gc: list nodes free: 3915518

after gc: idd nodes used:2689592, unused:61310408; list nodes free:271800296
.MC time: 2m36.176sec

checking: AG [EF [EG [1<=p467]]]
normalized: ~ [E [true U ~ [E [true U EG [1<=p467]]]]]

abstracting: (1<=p467)
states: 200,884,686,582,394,431,158,042,624 (26)
..............................................................
before gc: list nodes free: 18724000

after gc: idd nodes used:2514859, unused:61485141; list nodes free:272738768
................................................................................................................................................
EG iterations: 206
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-25-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m 0.480sec

checking: EX [AG [[AG [[p3<=0 | p185<=0]] & [A [AX [[1<=p5 & 1<=p263]] U p115<=0] | EX [EF [1<=p469]]]]]]
normalized: EX [~ [E [true U ~ [[[EX [E [true U 1<=p469]] | [~ [EG [~ [p115<=0]]] & ~ [E [~ [p115<=0] U [EX [~ [[1<=p5 & 1<=p263]]] & ~ [p115<=0]]]]]] & ~ [E [true U ~ [[p3<=0 | p185<=0]]]]]]]]]

abstracting: (p185<=0)
states: 49,733,203,841,586,750,685,217,455,969 (28)
abstracting: (p3<=0)
states: 24,765,049,616,979,406,829,474,629,165 (28)
abstracting: (p115<=0)
states: 38,612,109,312,274,412,933,425,478,584 (28)
abstracting: (1<=p263)
states: 283,302,097,400,665,486,241,911,808 (26)
abstracting: (1<=p5)
states: 25,190,019,066,363,116,050,031,768,748 (28)

before gc: list nodes free: 18278285

after gc: idd nodes used:2175498, unused:61824502; list nodes free:274226374
.abstracting: (p115<=0)
states: 38,612,109,312,274,412,933,425,478,584 (28)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6238036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098764 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 CTLFireability -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.002sec


iterations count:35229 (68), effective:1035 (2)

initing FirstDep: 0m 0.002sec


iterations count:522 (1), effective:1 (0)

sat_reach.icc:155: Timeout: after 252 sec


iterations count:515 (1), effective:0 (0)

iterations count:3618 (7), effective:68 (0)

iterations count:8186 (15), effective:252 (0)

iterations count:2111 (4), effective:25 (0)

iterations count:515 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 269 sec


iterations count:8487 (16), effective:273 (0)

iterations count:515 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 246 sec


iterations count:610 (1), effective:7 (0)

iterations count:515 (1), effective:0 (0)

iterations count:660 (1), effective:11 (0)

iterations count:14561 (28), effective:655 (1)

iterations count:557 (1), effective:4 (0)

iterations count:3984 (7), effective:186 (0)

iterations count:524 (1), effective:3 (0)

iterations count:13108 (25), effective:587 (1)

iterations count:17803 (34), effective:777 (1)

net_ddint.h:600: Timeout: after 281 sec


iterations count:13700 (26), effective:575 (1)

iterations count:623 (1), effective:8 (0)

net_ddint.h:600: Timeout: after 250 sec


iterations count:16864 (32), effective:748 (1)

net_ddint.h:600: Timeout: after 222 sec


iterations count:5744 (11), effective:162 (0)

iterations count:5774 (11), effective:164 (0)

net_ddint.h:600: Timeout: after 197 sec


iterations count:527 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 175 sec


iterations count:626 (1), effective:8 (0)

net_ddint.h:600: Timeout: after 155 sec


iterations count:515 (1), effective:0 (0)

iterations count:2111 (4), effective:25 (0)

iterations count:515 (1), effective:0 (0)

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="HirschbergSinclair-PT-25"
export BK_EXAMINATION="CTLFireability"
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 HirschbergSinclair-PT-25, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348700458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-25.tgz
mv HirschbergSinclair-PT-25 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;