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.r010-oct2-167813598500015.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598500015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 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 201K 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 ASLink-PT-01a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678655297140

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=ASLink-PT-01a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:08:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 21:08:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:08:20] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-12 21:08:20] [INFO ] Transformed 431 places.
[2023-03-12 21:08:20] [INFO ] Transformed 735 transitions.
[2023-03-12 21:08:20] [INFO ] Found NUPN structural information;
[2023-03-12 21:08:20] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 16) seen :2
FORMULA ASLink-PT-01a-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 728 rows 431 cols
[2023-03-12 21:08:22] [INFO ] Computed 80 place invariants in 43 ms
[2023-03-12 21:08:23] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 21:08:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-12 21:08:23] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 33 ms returned sat
[2023-03-12 21:08:46] [INFO ] After 22060ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :3
[2023-03-12 21:08:48] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 40 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 21:08:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:08:48] [INFO ] After 25135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA ASLink-PT-01a-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 4 different solutions.
FORMULA ASLink-PT-01a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 51 ms.
Support contains 141 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 426 transition count 711
Reduce places removed 17 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 409 transition count 707
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 405 transition count 707
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 47 place count 405 transition count 684
Deduced a syphon composed of 23 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 99 place count 376 transition count 684
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 375 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 374 transition count 683
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 105 place count 371 transition count 667
Iterating global reduction 5 with 3 rules applied. Total rules applied 108 place count 371 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 371 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 109 place count 371 transition count 664
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 114 place count 368 transition count 664
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 122 place count 364 transition count 660
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 123 place count 364 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 124 place count 363 transition count 659
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 125 place count 363 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 126 place count 362 transition count 658
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 362 transition count 658
Applied a total of 127 rules in 168 ms. Remains 362 /431 variables (removed 69) and now considering 658/728 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 362/431 places, 658/728 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 301167 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{2=1}
Probabilistic random walk after 301167 steps, saw 112955 distinct states, run finished after 3006 ms. (steps per millisecond=100 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 658 rows 362 cols
[2023-03-12 21:08:52] [INFO ] Computed 67 place invariants in 41 ms
[2023-03-12 21:08:52] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 21:08:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 21:08:52] [INFO ] [Nat]Absence check using 15 positive and 52 generalized place invariants in 15 ms returned sat
[2023-03-12 21:09:03] [INFO ] After 11151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 21:09:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 21:09:04] [INFO ] After 238ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 21:09:04] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 727 ms.
[2023-03-12 21:09:05] [INFO ] After 12576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 126 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 658/658 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 362 transition count 657
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 657
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 361 transition count 656
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 360 transition count 656
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 360 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 359 transition count 655
Applied a total of 6 rules in 66 ms. Remains 359 /362 variables (removed 3) and now considering 655/658 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 359/362 places, 655/658 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 395569 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{1=1}
Probabilistic random walk after 395569 steps, saw 149230 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 359 cols
[2023-03-12 21:09:08] [INFO ] Computed 67 place invariants in 30 ms
[2023-03-12 21:09:08] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:09:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-12 21:09:08] [INFO ] [Nat]Absence check using 15 positive and 52 generalized place invariants in 11 ms returned sat
[2023-03-12 21:09:18] [INFO ] After 9517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 117 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 655/655 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 359 transition count 653
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 357 transition count 653
Applied a total of 4 rules in 69 ms. Remains 357 /359 variables (removed 2) and now considering 653/655 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 357/359 places, 653/655 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 757921 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 757921 steps, saw 253584 distinct states, run finished after 3002 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 357 cols
[2023-03-12 21:09:21] [INFO ] Computed 67 place invariants in 13 ms
[2023-03-12 21:09:21] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:09:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 21:09:21] [INFO ] [Nat]Absence check using 15 positive and 52 generalized place invariants in 24 ms returned sat
[2023-03-12 21:09:31] [INFO ] After 9705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 117 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 653/653 transitions.
Applied a total of 0 rules in 21 ms. Remains 357 /357 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 357/357 places, 653/653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 653/653 transitions.
Applied a total of 0 rules in 33 ms. Remains 357 /357 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2023-03-12 21:09:31] [INFO ] Invariant cache hit.
[2023-03-12 21:09:31] [INFO ] Implicit Places using invariants in 261 ms returned [1, 20, 21, 24, 35, 53, 71, 147, 163, 168, 179, 183, 184, 218, 220, 243, 244, 256, 262, 274, 280, 286, 292, 298, 310, 316, 354]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 269 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 330/357 places, 653/653 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 330 transition count 647
Reduce places removed 6 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 13 rules applied. Total rules applied 19 place count 324 transition count 640
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 26 place count 317 transition count 640
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 317 transition count 638
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 315 transition count 638
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 39 place count 306 transition count 629
Iterating global reduction 3 with 9 rules applied. Total rules applied 48 place count 306 transition count 629
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 55 place count 299 transition count 622
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 299 transition count 622
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 294 transition count 617
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 294 transition count 616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 293 transition count 616
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 88 place count 293 transition count 602
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 102 place count 279 transition count 602
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 106 place count 279 transition count 602
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 113 place count 279 transition count 602
Applied a total of 113 rules in 126 ms. Remains 279 /330 variables (removed 51) and now considering 602/653 (removed 51) transitions.
// Phase 1: matrix 602 rows 279 cols
[2023-03-12 21:09:31] [INFO ] Computed 40 place invariants in 4 ms
[2023-03-12 21:09:32] [INFO ] Implicit Places using invariants in 352 ms returned [119, 247, 252, 257]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 353 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/357 places, 602/653 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 273 transition count 600
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 273 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 272 transition count 599
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 272 transition count 599
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 271 transition count 598
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 271 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 271 transition count 597
Applied a total of 9 rules in 28 ms. Remains 271 /275 variables (removed 4) and now considering 597/602 (removed 5) transitions.
// Phase 1: matrix 597 rows 271 cols
[2023-03-12 21:09:32] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-12 21:09:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 21:09:32] [INFO ] Invariant cache hit.
[2023-03-12 21:09:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 21:09:32] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 271/357 places, 597/653 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1321 ms. Remains : 271/357 places, 597/653 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 909932 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 909932 steps, saw 285294 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 21:09:35] [INFO ] Invariant cache hit.
[2023-03-12 21:09:35] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:09:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 21:09:35] [INFO ] [Nat]Absence check using 10 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-12 21:09:45] [INFO ] After 9646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 117 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 597/597 transitions.
Applied a total of 0 rules in 20 ms. Remains 271 /271 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 271/271 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 597/597 transitions.
Applied a total of 0 rules in 22 ms. Remains 271 /271 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-03-12 21:09:45] [INFO ] Invariant cache hit.
[2023-03-12 21:09:45] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 21:09:45] [INFO ] Invariant cache hit.
[2023-03-12 21:09:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 21:09:46] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2023-03-12 21:09:46] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 21:09:46] [INFO ] Invariant cache hit.
[2023-03-12 21:09:46] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1147 ms. Remains : 271/271 places, 597/597 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 271 transition count 596
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 270 transition count 596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 595
Applied a total of 4 rules in 14 ms. Remains 269 /271 variables (removed 2) and now considering 595/597 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 595 rows 269 cols
[2023-03-12 21:09:46] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-12 21:09:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 21:09:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-12 21:09:46] [INFO ] [Nat]Absence check using 11 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-12 21:09:50] [INFO ] After 3521ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ASLink-PT-01a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 90243 ms.
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: ASLink_PT_01a
(NrP: 431 NrTr: 735 NrArc: 2801)

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

net check time: 0m 0.013sec

init dd package: 0m 2.948sec


RS generation: 1m11.975sec


-> reachability set: #nodes 22241 (2.2e+04) #states 189,402,887 (8)



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

checking: EF [IS_FIREABLE [t549]]
normalized: E [true U IS_FIREABLE [t549]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [~ [IS_FIREABLE [t12]]]
normalized: ~ [E [true U IS_FIREABLE [t12]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.478sec

checking: EF [IS_FIREABLE [t226]]
normalized: E [true U IS_FIREABLE [t226]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [IS_FIREABLE [t196]]
normalized: E [true U IS_FIREABLE [t196]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [IS_FIREABLE [t7]]]
normalized: ~ [E [true U IS_FIREABLE [t7]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.339sec

checking: AG [~ [[IS_FIREABLE [t511] | IS_FIREABLE [t131]]]]
normalized: ~ [E [true U [IS_FIREABLE [t511] | IS_FIREABLE [t131]]]]

-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[IS_FIREABLE [t87] & [IS_FIREABLE [t703] & [~ [IS_FIREABLE [t486]] & IS_FIREABLE [t84]]]]]
normalized: E [true U [IS_FIREABLE [t87] & [IS_FIREABLE [t703] & [IS_FIREABLE [t84] & ~ [IS_FIREABLE [t486]]]]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[~ [IS_FIREABLE [t114]] | ~ [[IS_FIREABLE [t597] & [[[IS_FIREABLE [t360] & IS_FIREABLE [t496]] & [IS_FIREABLE [t401] & IS_FIREABLE [t630]]] & ~ [IS_FIREABLE [t617]]]]]]]
normalized: ~ [E [true U ~ [[~ [[IS_FIREABLE [t597] & [~ [IS_FIREABLE [t617]] & [[IS_FIREABLE [t401] & IS_FIREABLE [t630]] & [IS_FIREABLE [t360] & IS_FIREABLE [t496]]]]]] | ~ [IS_FIREABLE [t114]]]]]]

-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [[IS_FIREABLE [t425] & ~ [[[IS_FIREABLE [t472] & [[[~ [IS_FIREABLE [t107]] | [IS_FIREABLE [t728] | ~ [IS_FIREABLE [t176]]]] | IS_FIREABLE [t427]] | IS_FIREABLE [t551]]] | ~ [IS_FIREABLE [t335]]]]]]
normalized: E [true U [IS_FIREABLE [t425] & ~ [[~ [IS_FIREABLE [t335]] | [IS_FIREABLE [t472] & [IS_FIREABLE [t551] | [IS_FIREABLE [t427] | [[IS_FIREABLE [t728] | ~ [IS_FIREABLE [t176]]] | ~ [IS_FIREABLE [t107]]]]]]]]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EF [[[IS_FIREABLE [t282] | IS_FIREABLE [t254]] & [[IS_FIREABLE [t567] | [~ [[[IS_FIREABLE [t291] & ~ [IS_FIREABLE [t428]]] & IS_FIREABLE [t405]]] & IS_FIREABLE [t647]]] | IS_FIREABLE [t644]]]]
normalized: E [true U [[IS_FIREABLE [t644] | [IS_FIREABLE [t567] | [IS_FIREABLE [t647] & ~ [[IS_FIREABLE [t405] & [IS_FIREABLE [t291] & ~ [IS_FIREABLE [t428]]]]]]]] & [IS_FIREABLE [t282] | IS_FIREABLE [t254]]]]

-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.840sec

checking: AG [[~ [IS_FIREABLE [t126]] | [IS_FIREABLE [t669] & ~ [[[[[~ [IS_FIREABLE [t431]] | [IS_FIREABLE [t143] & IS_FIREABLE [t674]]] | IS_FIREABLE [t512]] & [[IS_FIREABLE [t576] & ~ [IS_FIREABLE [t23]]] & [IS_FIREABLE [t642] | [IS_FIREABLE [t370] | IS_FIREABLE [t89]]]]] & ~ [[~ [IS_FIREABLE [t719]] & ~ [[IS_FIREABLE [t520] & IS_FIREABLE [t29]]]]]]]]]]
normalized: ~ [E [true U ~ [[[IS_FIREABLE [t669] & ~ [[~ [[~ [[IS_FIREABLE [t520] & IS_FIREABLE [t29]]] & ~ [IS_FIREABLE [t719]]]] & [[[IS_FIREABLE [t642] | [IS_FIREABLE [t370] | IS_FIREABLE [t89]]] & [IS_FIREABLE [t576] & ~ [IS_FIREABLE [t23]]]] & [IS_FIREABLE [t512] | [[IS_FIREABLE [t143] & IS_FIREABLE [t674]] | ~ [IS_FIREABLE [t431]]]]]]]] | ~ [IS_FIREABLE [t126]]]]]]

-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [[[~ [IS_FIREABLE [t272]] | ~ [[IS_FIREABLE [t243] & [~ [IS_FIREABLE [t465]] & IS_FIREABLE [t109]]]]] & ~ [[~ [[[IS_FIREABLE [t686] | [~ [IS_FIREABLE [t670]] & [IS_FIREABLE [t733] | IS_FIREABLE [t721]]]] | [[~ [IS_FIREABLE [t213]] & [IS_FIREABLE [t328] | IS_FIREABLE [t447]]] & [IS_FIREABLE [t613] & IS_FIREABLE [t503]]]]] & [~ [[IS_FIREABLE [t611] & ~ [[IS_FIREABLE [t439] & IS_FIREABLE [t724]]]]] & IS_FIREABLE [t728]]]]]]
normalized: ~ [E [true U ~ [[~ [[[IS_FIREABLE [t728] & ~ [[IS_FIREABLE [t611] & ~ [[IS_FIREABLE [t439] & IS_FIREABLE [t724]]]]]] & ~ [[[[IS_FIREABLE [t613] & IS_FIREABLE [t503]] & [[IS_FIREABLE [t328] | IS_FIREABLE [t447]] & ~ [IS_FIREABLE [t213]]]] | [IS_FIREABLE [t686] | [[IS_FIREABLE [t733] | IS_FIREABLE [t721]] & ~ [IS_FIREABLE [t670]]]]]]]] & [~ [[IS_FIREABLE [t243] & [IS_FIREABLE [t109] & ~ [IS_FIREABLE [t465]]]]] | ~ [IS_FIREABLE [t272]]]]]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.245sec

checking: AG [[~ [[IS_FIREABLE [t207] & ~ [IS_FIREABLE [t168]]]] | [~ [[~ [IS_FIREABLE [t289]] & [[[~ [[IS_FIREABLE [t455] | IS_FIREABLE [t372]]] | [~ [IS_FIREABLE [t547]] & IS_FIREABLE [t101]]] & [[[IS_FIREABLE [t132] & IS_FIREABLE [t580]] & ~ [IS_FIREABLE [t315]]] & IS_FIREABLE [t641]]] | [[[[IS_FIREABLE [t283] | IS_FIREABLE [t432]] & ~ [IS_FIREABLE [t270]]] & ~ [IS_FIREABLE [t608]]] | [IS_FIREABLE [t242] | [~ [IS_FIREABLE [t399]] | [IS_FIREABLE [t115] | IS_FIREABLE [t162]]]]]]]] & ~ [[[[[~ [IS_FIREABLE [t320]] | IS_FIREABLE [t332]] | ~ [IS_FIREABLE [t332]]] | ~ [IS_FIREABLE [t691]]] | [~ [[~ [IS_FIREABLE [t258]] | [IS_FIREABLE [t25] & IS_FIREABLE [t349]]]] & [~ [IS_FIREABLE [t432]] & [~ [[IS_FIREABLE [t653] & IS_FIREABLE [t721]]] | IS_FIREABLE [t242]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[IS_FIREABLE [t242] | ~ [[IS_FIREABLE [t653] & IS_FIREABLE [t721]]]] & ~ [IS_FIREABLE [t432]]] & ~ [[[IS_FIREABLE [t25] & IS_FIREABLE [t349]] | ~ [IS_FIREABLE [t258]]]]] | [~ [IS_FIREABLE [t691]] | [~ [IS_FIREABLE [t332]] | [IS_FIREABLE [t332] | ~ [IS_FIREABLE [t320]]]]]]] & ~ [[[[[IS_FIREABLE [t242] | [[IS_FIREABLE [t115] | IS_FIREABLE [t162]] | ~ [IS_FIREABLE [t399]]]] | [~ [IS_FIREABLE [t608]] & [~ [IS_FIREABLE [t270]] & [IS_FIREABLE [t283] | IS_FIREABLE [t432]]]]] | [[IS_FIREABLE [t641] & [~ [IS_FIREABLE [t315]] & [IS_FIREABLE [t132] & IS_FIREABLE [t580]]]] & [[IS_FIREABLE [t101] & ~ [IS_FIREABLE [t547]]] | ~ [[IS_FIREABLE [t455] | IS_FIREABLE [t372]]]]]] & ~ [IS_FIREABLE [t289]]]]] | ~ [[IS_FIREABLE [t207] & ~ [IS_FIREABLE [t168]]]]]]]]

-> the formula is TRUE

FORMULA ASLink-PT-01a-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: AG [[[[~ [IS_FIREABLE [t432]] & [[[IS_FIREABLE [t77] & [IS_FIREABLE [t524] | IS_FIREABLE [t431]]] & ~ [[~ [IS_FIREABLE [t190]] & [IS_FIREABLE [t624] | IS_FIREABLE [t47]]]]] | IS_FIREABLE [t16]]] | [[[~ [[[IS_FIREABLE [t715] & IS_FIREABLE [t322]] | IS_FIREABLE [t471]]] & ~ [IS_FIREABLE [t541]]] | [~ [[IS_FIREABLE [t540] & IS_FIREABLE [t162]]] | [~ [[IS_FIREABLE [t464] & [IS_FIREABLE [t113] | IS_FIREABLE [t467]]]] & [~ [IS_FIREABLE [t700]] & [[IS_FIREABLE [t303] | IS_FIREABLE [t589]] | [IS_FIREABLE [t457] & IS_FIREABLE [t11]]]]]]] & ~ [[IS_FIREABLE [t574] | [IS_FIREABLE [t222] | [~ [IS_FIREABLE [t571]] | [IS_FIREABLE [t702] | [IS_FIREABLE [t254] | IS_FIREABLE [t94]]]]]]]]] | [[~ [[[~ [[[IS_FIREABLE [t285] | IS_FIREABLE [t295]] | IS_FIREABLE [t524]]] & IS_FIREABLE [t390]] & ~ [[IS_FIREABLE [t20] & ~ [IS_FIREABLE [t126]]]]]] & ~ [IS_FIREABLE [t701]]] & [IS_FIREABLE [t622] | [IS_FIREABLE [t472] | ~ [[IS_FIREABLE [t310] & ~ [[[IS_FIREABLE [t268] & IS_FIREABLE [t384]] | IS_FIREABLE [t416]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[IS_FIREABLE [t622] | [IS_FIREABLE [t472] | ~ [[IS_FIREABLE [t310] & ~ [[IS_FIREABLE [t416] | [IS_FIREABLE [t268] & IS_FIREABLE [t384]]]]]]]] & [~ [IS_FIREABLE [t701]] & ~ [[~ [[IS_FIREABLE [t20] & ~ [IS_FIREABLE [t126]]]] & [IS_FIREABLE [t390] & ~ [[IS_FIREABLE [t524] | [IS_FIREABLE [t285] | IS_FIREABLE [t295]]]]]]]]] | [[~ [[IS_FIREABLE [t574] | [IS_FIREABLE [t222] | [[IS_FIREABLE [t702] | [IS_FIREABLE [t254] | IS_FIREABLE [t94]]] | ~ [IS_FIREABLE [t571]]]]]] & [[[[[[IS_FIREABLE [t457] & IS_FIREABLE [t11]] | [IS_FIREABLE [t303] | IS_FIREABLE [t589]]] & ~ [IS_FIREABLE [t700]]] & ~ [[IS_FIREABLE [t464] & [IS_FIREABLE [t113] | IS_FIREABLE [t467]]]]] | ~ [[IS_FIREABLE [t540] & IS_FIREABLE [t162]]]] | [~ [IS_FIREABLE [t541]] & ~ [[IS_FIREABLE [t471] | [IS_FIREABLE [t715] & IS_FIREABLE [t322]]]]]]] | [[IS_FIREABLE [t16] | [~ [[[IS_FIREABLE [t624] | IS_FIREABLE [t47]] & ~ [IS_FIREABLE [t190]]]] & [IS_FIREABLE [t77] & [IS_FIREABLE [t524] | IS_FIREABLE [t431]]]]] & ~ [IS_FIREABLE [t432]]]]]]]]


before gc: list nodes free: 174302

after gc: idd nodes used:53144, unused:63946856; list nodes free:282884491
-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.642sec

checking: EF [[[~ [[[[[IS_FIREABLE [t18] | ~ [IS_FIREABLE [t607]]] & [IS_FIREABLE [t432] | ~ [IS_FIREABLE [t220]]]] | [[[IS_FIREABLE [t671] & IS_FIREABLE [t554]] & ~ [IS_FIREABLE [t668]]] | [[IS_FIREABLE [t431] & IS_FIREABLE [t251]] | ~ [IS_FIREABLE [t241]]]]] | ~ [IS_FIREABLE [t685]]]] & [[[[IS_FIREABLE [t138] & [~ [[IS_FIREABLE [t518] & IS_FIREABLE [t243]]] & [~ [IS_FIREABLE [t654]] | IS_FIREABLE [t542]]]] & ~ [[IS_FIREABLE [t151] & ~ [IS_FIREABLE [t540]]]]] & [~ [[~ [[IS_FIREABLE [t584] | IS_FIREABLE [t188]]] & [~ [IS_FIREABLE [t109]] & [IS_FIREABLE [t492] | IS_FIREABLE [t59]]]]] & [[~ [[IS_FIREABLE [t611] | IS_FIREABLE [t101]]] & IS_FIREABLE [t109]] & IS_FIREABLE [t446]]]] & [[[~ [[[IS_FIREABLE [t167] | IS_FIREABLE [t365]] & [IS_FIREABLE [t171] & IS_FIREABLE [t721]]]] & IS_FIREABLE [t151]] | [~ [[IS_FIREABLE [t399] & IS_FIREABLE [t568]]] | [IS_FIREABLE [t361] | ~ [IS_FIREABLE [t516]]]]] | ~ [IS_FIREABLE [t31]]]]] | ~ [[~ [IS_FIREABLE [t511]] | [[IS_FIREABLE [t76] | IS_FIREABLE [t222]] & [[IS_FIREABLE [t247] | [~ [IS_FIREABLE [t595]] & IS_FIREABLE [t35]]] | [IS_FIREABLE [t416] | IS_FIREABLE [t540]]]]]]]]
normalized: E [true U [~ [[[[[IS_FIREABLE [t416] | IS_FIREABLE [t540]] | [IS_FIREABLE [t247] | [IS_FIREABLE [t35] & ~ [IS_FIREABLE [t595]]]]] & [IS_FIREABLE [t76] | IS_FIREABLE [t222]]] | ~ [IS_FIREABLE [t511]]]] | [[[~ [IS_FIREABLE [t31]] | [[[IS_FIREABLE [t361] | ~ [IS_FIREABLE [t516]]] | ~ [[IS_FIREABLE [t399] & IS_FIREABLE [t568]]]] | [IS_FIREABLE [t151] & ~ [[[IS_FIREABLE [t171] & IS_FIREABLE [t721]] & [IS_FIREABLE [t167] | IS_FIREABLE [t365]]]]]]] & [[[IS_FIREABLE [t446] & [IS_FIREABLE [t109] & ~ [[IS_FIREABLE [t611] | IS_FIREABLE [t101]]]]] & ~ [[[[IS_FIREABLE [t492] | IS_FIREABLE [t59]] & ~ [IS_FIREABLE [t109]]] & ~ [[IS_FIREABLE [t584] | IS_FIREABLE [t188]]]]]] & [~ [[IS_FIREABLE [t151] & ~ [IS_FIREABLE [t540]]]] & [IS_FIREABLE [t138] & [[IS_FIREABLE [t542] | ~ [IS_FIREABLE [t654]]] & ~ [[IS_FIREABLE [t518] & IS_FIREABLE [t243]]]]]]]] & ~ [[~ [IS_FIREABLE [t685]] | [[[~ [IS_FIREABLE [t241]] | [IS_FIREABLE [t431] & IS_FIREABLE [t251]]] | [~ [IS_FIREABLE [t668]] & [IS_FIREABLE [t671] & IS_FIREABLE [t554]]]] | [[IS_FIREABLE [t432] | ~ [IS_FIREABLE [t220]]] & [IS_FIREABLE [t18] | ~ [IS_FIREABLE [t607]]]]]]]]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: EF [[[[[~ [[~ [IS_FIREABLE [t120]] | IS_FIREABLE [t604]]] | [~ [[IS_FIREABLE [t19] | IS_FIREABLE [t492]]] | [[~ [[IS_FIREABLE [t258] | IS_FIREABLE [t52]]] & ~ [[IS_FIREABLE [t206] | IS_FIREABLE [t534]]]] | ~ [[[IS_FIREABLE [t453] & IS_FIREABLE [t469]] & [IS_FIREABLE [t591] & IS_FIREABLE [t411]]]]]]] & [[[IS_FIREABLE [t569] | [IS_FIREABLE [t321] | ~ [[IS_FIREABLE [t555] & IS_FIREABLE [t323]]]]] | ~ [[[IS_FIREABLE [t72] & [IS_FIREABLE [t16] & IS_FIREABLE [t89]]] & IS_FIREABLE [t70]]]] & ~ [IS_FIREABLE [t318]]]] & ~ [[~ [[IS_FIREABLE [t462] | IS_FIREABLE [t472]]] & [[[[IS_FIREABLE [t18] & IS_FIREABLE [t4]] | [IS_FIREABLE [t301] & IS_FIREABLE [t337]]] | [~ [IS_FIREABLE [t482]] | ~ [IS_FIREABLE [t49]]]] | ~ [IS_FIREABLE [t573]]]]]] | [[~ [[[[[IS_FIREABLE [t621] & ~ [IS_FIREABLE [t434]]] | [[IS_FIREABLE [t381] | IS_FIREABLE [t276]] | ~ [IS_FIREABLE [t483]]]] & ~ [[[IS_FIREABLE [t319] | IS_FIREABLE [t605]] | [IS_FIREABLE [t131] & IS_FIREABLE [t367]]]]] & ~ [[[IS_FIREABLE [t146] | IS_FIREABLE [t295]] & ~ [IS_FIREABLE [t507]]]]]] & [[[[~ [IS_FIREABLE [t92]] | [~ [IS_FIREABLE [t140]] & IS_FIREABLE [t658]]] & IS_FIREABLE [t288]] & [~ [[IS_FIREABLE [t403] & [IS_FIREABLE [t641] | IS_FIREABLE [t725]]]] & [[IS_FIREABLE [t428] | [IS_FIREABLE [t324] | IS_FIREABLE [t718]]] & [[IS_FIREABLE [t455] | IS_FIREABLE [t233]] | [IS_FIREABLE [t146] & IS_FIREABLE [t422]]]]]] & [[[[[IS_FIREABLE [t244] | IS_FIREABLE [t442]] | IS_FIREABLE [t532]] & [[IS_FIREABLE [t519] | IS_FIREABLE [t341]] & [IS_FIREABLE [t107] & IS_FIREABLE [t456]]]] | IS_FIREABLE [t229]] & [IS_FIREABLE [t210] | [[[IS_FIREABLE [t185] | IS_FIREABLE [t344]] | [IS_FIREABLE [t432] & IS_FIREABLE [t497]]] | [IS_FIREABLE [t504] & IS_FIREABLE [t267]]]]]]] | [[[IS_FIREABLE [t438] & [~ [[[IS_FIREABLE [t205] | IS_FIREABLE [t248]] & IS_FIREABLE [t45]]] & ~ [[IS_FIREABLE [t5] | IS_FIREABLE [t455]]]]] | [[IS_FIREABLE [t299] | [~ [[IS_FIREABLE [t383] & IS_FIREABLE [t464]]] | ~ [IS_FIREABLE [t8]]]] & [[[[IS_FIREABLE [t476] | IS_FIREABLE [t508]] | [IS_FIREABLE [t124] | IS_FIREABLE [t348]]] & IS_FIREABLE [t243]] & [~ [[IS_FIREABLE [t305] & IS_FIREABLE [t389]]] | [~ [IS_FIREABLE [t423]] & [IS_FIREABLE [t421] | IS_FIREABLE [t234]]]]]]] & [~ [[IS_FIREABLE [t272] | [[~ [IS_FIREABLE [t665]] | [IS_FIREABLE [t495] & IS_FIREABLE [t208]]] | [~ [IS_FIREABLE [t336]] | ~ [IS_FIREABLE [t135]]]]]] | ~ [IS_FIREABLE [t259]]]]]]]
normalized: E [true U [[[[~ [IS_FIREABLE [t259]] | ~ [[IS_FIREABLE [t272] | [[~ [IS_FIREABLE [t135]] | ~ [IS_FIREABLE [t336]]] | [[IS_FIREABLE [t495] & IS_FIREABLE [t208]] | ~ [IS_FIREABLE [t665]]]]]]] & [[[[[[IS_FIREABLE [t421] | IS_FIREABLE [t234]] & ~ [IS_FIREABLE [t423]]] | ~ [[IS_FIREABLE [t305] & IS_FIREABLE [t389]]]] & [IS_FIREABLE [t243] & [[IS_FIREABLE [t124] | IS_FIREABLE [t348]] | [IS_FIREABLE [t476] | IS_FIREABLE [t508]]]]] & [IS_FIREABLE [t299] | [~ [IS_FIREABLE [t8]] | ~ [[IS_FIREABLE [t383] & IS_FIREABLE [t464]]]]]] | [IS_FIREABLE [t438] & [~ [[IS_FIREABLE [t5] | IS_FIREABLE [t455]]] & ~ [[IS_FIREABLE [t45] & [IS_FIREABLE [t205] | IS_FIREABLE [t248]]]]]]]] | [[[[IS_FIREABLE [t210] | [[IS_FIREABLE [t504] & IS_FIREABLE [t267]] | [[IS_FIREABLE [t432] & IS_FIREABLE [t497]] | [IS_FIREABLE [t185] | IS_FIREABLE [t344]]]]] & [IS_FIREABLE [t229] | [[[IS_FIREABLE [t107] & IS_FIREABLE [t456]] & [IS_FIREABLE [t519] | IS_FIREABLE [t341]]] & [IS_FIREABLE [t532] | [IS_FIREABLE [t244] | IS_FIREABLE [t442]]]]]] & [[[[[IS_FIREABLE [t146] & IS_FIREABLE [t422]] | [IS_FIREABLE [t455] | IS_FIREABLE [t233]]] & [IS_FIREABLE [t428] | [IS_FIREABLE [t324] | IS_FIREABLE [t718]]]] & ~ [[IS_FIREABLE [t403] & [IS_FIREABLE [t641] | IS_FIREABLE [t725]]]]] & [IS_FIREABLE [t288] & [[IS_FIREABLE [t658] & ~ [IS_FIREABLE [t140]]] | ~ [IS_FIREABLE [t92]]]]]] & ~ [[~ [[~ [IS_FIREABLE [t507]] & [IS_FIREABLE [t146] | IS_FIREABLE [t295]]]] & [~ [[[IS_FIREABLE [t131] & IS_FIREABLE [t367]] | [IS_FIREABLE [t319] | IS_FIREABLE [t605]]]] & [[~ [IS_FIREABLE [t483]] | [IS_FIREABLE [t381] | IS_FIREABLE [t276]]] | [IS_FIREABLE [t621] & ~ [IS_FIREABLE [t434]]]]]]]]] | [~ [[[~ [IS_FIREABLE [t573]] | [[~ [IS_FIREABLE [t49]] | ~ [IS_FIREABLE [t482]]] | [[IS_FIREABLE [t301] & IS_FIREABLE [t337]] | [IS_FIREABLE [t18] & IS_FIREABLE [t4]]]]] & ~ [[IS_FIREABLE [t462] | IS_FIREABLE [t472]]]]] & [[~ [IS_FIREABLE [t318]] & [~ [[IS_FIREABLE [t70] & [IS_FIREABLE [t72] & [IS_FIREABLE [t16] & IS_FIREABLE [t89]]]]] | [IS_FIREABLE [t569] | [IS_FIREABLE [t321] | ~ [[IS_FIREABLE [t555] & IS_FIREABLE [t323]]]]]]] & [[[~ [[[IS_FIREABLE [t591] & IS_FIREABLE [t411]] & [IS_FIREABLE [t453] & IS_FIREABLE [t469]]]] | [~ [[IS_FIREABLE [t206] | IS_FIREABLE [t534]]] & ~ [[IS_FIREABLE [t258] | IS_FIREABLE [t52]]]]] | ~ [[IS_FIREABLE [t19] | IS_FIREABLE [t492]]]] | ~ [[IS_FIREABLE [t604] | ~ [IS_FIREABLE [t120]]]]]]]]]

-> the formula is FALSE

FORMULA ASLink-PT-01a-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.418sec

totally nodes used: 68617924 (6.9e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 494243259 1487463814 1981707073
used/not used/entry size/cache size: 50947388 16161476 16 1024MB
basic ops cache: hits/miss/sum: 29579099 69395410 98974509
used/not used/entry size/cache size: 7694849 9082367 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3718 22242 25960
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 63292891
1 3133921
2 538054
3 119000
4 21447
5 3110
6 390
7 47
8 4
9 0
>= 10 0

Total processing time: 6m 9.021sec


BK_STOP 1678655759706

--------------------
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.002sec

10344 12252 12976 12998 14204 17743 15931 16998 17015 17443 18111 28183 22918 23983 24471 24509 24585 24430 25043 25076 25538 35846 25456 24834 24017 24410 24444 24313 23995 23452
iterations count:3076780 (4186), effective:68168 (92)

initing FirstDep: 0m 0.003sec

24551 26986 27260 28470 28054 27184 24019
iterations count:703937 (957), effective:16827 (22)
21012 26158 26620 26887 26949 26654 25197
iterations count:722324 (982), effective:17241 (23)
24327 25855 26218 26472 25984 25928 24885 43158 35614 37121 39301 38891 39432 39813 47461 40354 39485 39582 39107 39269 37755
iterations count:2121856 (2886), effective:48768 (66)
32819 33429 35737 38500 38154 38662 38536 47614 42271 42423 42203 42637 42657 42717
iterations count:1417997 (1929), effective:33124 (45)
31186 32259 34465 34126 33172 30166
iterations count:658483 (895), effective:16069 (21)

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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r010-oct2-167813598500015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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