About the Execution of Marcie+red for StigmergyCommit-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8449.764 | 615399.00 | 645255.00 | 8048.50 | TFTTFTFFFFTTFFFT | normal |
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.r458-smll-167912650400510.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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650400510
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 11:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 11:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 51M Mar 5 18:23 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 StigmergyCommit-PT-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679496292391
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:44:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 14:44:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:44:58] [INFO ] Load time of PNML (sax parser for PT used): 2919 ms
[2023-03-22 14:44:58] [INFO ] Transformed 364 places.
[2023-03-22 14:44:58] [INFO ] Transformed 50444 transitions.
[2023-03-22 14:44:59] [INFO ] Found NUPN structural information;
[2023-03-22 14:44:59] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 3432 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1894 ms. (steps per millisecond=5 ) properties (out of 16) seen :3
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-22 14:45:01] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2023-03-22 14:45:02] [INFO ] Computed 11 place invariants in 56 ms
[2023-03-22 14:45:02] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 14:45:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-03-22 14:45:05] [INFO ] After 1856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 14:45:05] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2023-03-22 14:45:07] [INFO ] After 2137ms SMT Verify possible using 2185 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-22 14:45:09] [INFO ] Deduced a trap composed of 17 places in 1525 ms of which 10 ms to minimize.
[2023-03-22 14:45:10] [INFO ] Deduced a trap composed of 17 places in 1255 ms of which 2 ms to minimize.
[2023-03-22 14:45:11] [INFO ] Deduced a trap composed of 16 places in 909 ms of which 1 ms to minimize.
[2023-03-22 14:45:12] [INFO ] Deduced a trap composed of 17 places in 979 ms of which 2 ms to minimize.
[2023-03-22 14:45:13] [INFO ] Deduced a trap composed of 18 places in 1058 ms of which 2 ms to minimize.
[2023-03-22 14:45:14] [INFO ] Deduced a trap composed of 17 places in 843 ms of which 1 ms to minimize.
[2023-03-22 14:45:16] [INFO ] Deduced a trap composed of 16 places in 1174 ms of which 1 ms to minimize.
[2023-03-22 14:45:16] [INFO ] Deduced a trap composed of 18 places in 644 ms of which 1 ms to minimize.
[2023-03-22 14:45:17] [INFO ] Deduced a trap composed of 16 places in 724 ms of which 1 ms to minimize.
[2023-03-22 14:45:19] [INFO ] Deduced a trap composed of 16 places in 1131 ms of which 1 ms to minimize.
[2023-03-22 14:45:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 11379 ms
[2023-03-22 14:45:19] [INFO ] Deduced a trap composed of 17 places in 553 ms of which 5 ms to minimize.
[2023-03-22 14:45:20] [INFO ] Deduced a trap composed of 16 places in 624 ms of which 1 ms to minimize.
[2023-03-22 14:45:21] [INFO ] Deduced a trap composed of 17 places in 594 ms of which 1 ms to minimize.
[2023-03-22 14:45:21] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 1 ms to minimize.
[2023-03-22 14:45:22] [INFO ] Deduced a trap composed of 17 places in 711 ms of which 1 ms to minimize.
[2023-03-22 14:45:23] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2023-03-22 14:45:23] [INFO ] Deduced a trap composed of 16 places in 603 ms of which 1 ms to minimize.
[2023-03-22 14:45:24] [INFO ] Deduced a trap composed of 16 places in 561 ms of which 1 ms to minimize.
[2023-03-22 14:45:25] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 1 ms to minimize.
[2023-03-22 14:45:25] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-22 14:45:26] [INFO ] Deduced a trap composed of 16 places in 726 ms of which 1 ms to minimize.
[2023-03-22 14:45:27] [INFO ] Deduced a trap composed of 16 places in 602 ms of which 1 ms to minimize.
[2023-03-22 14:45:27] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 1 ms to minimize.
[2023-03-22 14:45:28] [INFO ] Deduced a trap composed of 18 places in 382 ms of which 1 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-22 14:45:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:45:28] [INFO ] After 25275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 172 ms.
Support contains 78 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 359 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.51 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 359 transition count 2449
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 60 rules applied. Total rules applied 127 place count 324 transition count 2424
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 137 place count 319 transition count 2419
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 145 place count 314 transition count 2416
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 145 place count 314 transition count 2370
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 237 place count 268 transition count 2370
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 274 place count 231 transition count 2333
Iterating global reduction 4 with 37 rules applied. Total rules applied 311 place count 231 transition count 2333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 313 place count 231 transition count 2331
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 332 place count 212 transition count 2312
Iterating global reduction 5 with 19 rules applied. Total rules applied 351 place count 212 transition count 2312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 358 place count 212 transition count 2305
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 378 place count 202 transition count 2295
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 384 place count 196 transition count 2289
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 196 transition count 2289
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 395 place count 191 transition count 2284
Iterating global reduction 6 with 5 rules applied. Total rules applied 400 place count 191 transition count 2284
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 402 place count 189 transition count 2282
Iterating global reduction 6 with 2 rules applied. Total rules applied 404 place count 189 transition count 2282
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 419 place count 189 transition count 2267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 421 place count 188 transition count 2266
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 422 place count 187 transition count 2265
Iterating global reduction 6 with 1 rules applied. Total rules applied 423 place count 187 transition count 2265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 424 place count 187 transition count 2264
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 442 place count 187 transition count 2246
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 460 place count 169 transition count 2246
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 462 place count 169 transition count 2244
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 471 place count 169 transition count 2244
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 478 place count 169 transition count 2237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 479 place count 168 transition count 2236
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 9 rules applied. Total rules applied 488 place count 167 transition count 2228
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 9 with 15 rules applied. Total rules applied 503 place count 159 transition count 2221
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 510 place count 152 transition count 2221
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 8 Pre rules applied. Total rules applied 510 place count 152 transition count 2213
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 526 place count 144 transition count 2213
Performed 12 Post agglomeration using F-continuation condition with reduction of 1085 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 550 place count 132 transition count 1116
Drop transitions removed 3 transitions
Ensure Unique test removed 636 transitions
Reduce isomorphic transitions removed 639 transitions.
Iterating post reduction 11 with 639 rules applied. Total rules applied 1189 place count 132 transition count 477
Drop transitions removed 244 transitions
Redundant transition composition rules discarded 244 transitions
Iterating global reduction 12 with 244 rules applied. Total rules applied 1433 place count 132 transition count 233
Free-agglomeration rule applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 1438 place count 132 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1443 place count 127 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1445 place count 125 transition count 226
Applied a total of 1445 rules in 5213 ms. Remains 125 /364 variables (removed 239) and now considering 226/2520 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5214 ms. Remains : 125/364 places, 226/2520 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 12) seen :10
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 226 rows 125 cols
[2023-03-22 14:45:33] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-22 14:45:33] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:45:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 14:45:34] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:45:34] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-22 14:45:34] [INFO ] After 27ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-22 14:45:34] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-22 14:45:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1083 ms
[2023-03-22 14:45:35] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-22 14:45:35] [INFO ] After 1259ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 39641 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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: StigmergyCommit_PT_09a
(NrP: 364 NrTr: 50444 NrArc: 999956)
parse formulas
formulas created successfully
place and transition orderings generation:1m17.809sec
net check time: 0m 0.148sec
init dd package: 0m 3.312sec
RS generation: 2m41.851sec
-> reachability set: #nodes 458319 (4.6e+05) #states 373,996,883 (8)
starting MCC model checker
--------------------------
checking: EF [1<=p243]
normalized: E [true U 1<=p243]
abstracting: (1<=p243)
states: 1
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m25.118sec
checking: AG [~ [1<=p4]]
normalized: ~ [E [true U 1<=p4]]
abstracting: (1<=p4)
states: 1,953,125 (6)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.342sec
checking: AG [p52<=0]
normalized: ~ [E [true U ~ [p52<=0]]]
abstracting: (p52<=0)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.738sec
checking: EF [~ [p194<=0]]
normalized: E [true U ~ [p194<=0]]
abstracting: (p194<=0)
states: 373,996,882 (8)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.465sec
checking: AG [p306<=p271]
normalized: ~ [E [true U ~ [p306<=p271]]]
abstracting: (p306<=p271)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.869sec
checking: AG [p232<=p6]
normalized: ~ [E [true U ~ [p232<=p6]]]
abstracting: (p232<=p6)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.637sec
checking: EF [[1<=p86 & p177<=0]]
normalized: E [true U [1<=p86 & p177<=0]]
abstracting: (p177<=0)
states: 322,113,674 (8)
abstracting: (1<=p86)
states: 1
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.873sec
checking: EF [~ [[p289<=p270 | ~ [p212<=p247]]]]
normalized: E [true U ~ [[p289<=p270 | ~ [p212<=p247]]]]
abstracting: (p212<=p247)
states: 329,525,561 (8)
abstracting: (p289<=p270)
states: 372,043,758 (8)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m36.820sec
checking: AG [[~ [[[[~ [[p154<=p80 | ~ [1<=p347]]] & [1<=p103 | ~ [[p158<=1 & p51<=p202]]]] | [~ [[[~ [1<=p0] & ~ [p192<=0]] & [[p77<=0 | 1<=p237] | ~ [1<=p200]]]] & [~ [1<=p341] & ~ [[~ [p242<=p233] | p271<=1]]]]] & 1<=p44]] & p278<=0]]
normalized: ~ [E [true U ~ [[p278<=0 & ~ [[1<=p44 & [[[~ [[p271<=1 | ~ [p242<=p233]]] & ~ [1<=p341]] & ~ [[[~ [1<=p200] | [p77<=0 | 1<=p237]] & [~ [p192<=0] & ~ [1<=p0]]]]] | [[1<=p103 | ~ [[p158<=1 & p51<=p202]]] & ~ [[p154<=p80 | ~ [1<=p347]]]]]]]]]]]
abstracting: (1<=p347)
states: 1
abstracting: (p154<=p80)
states: 373,996,882 (8)
abstracting: (p51<=p202)
states: 373,996,882 (8)
abstracting: (p158<=1)
states: 373,996,883 (8)
abstracting: (1<=p103)
states: 51,883,209 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p192<=0)
states: 373,996,882 (8)
abstracting: (1<=p237)
states: 1
abstracting: (p77<=0)
states: 373,734,739 (8)
abstracting: (1<=p200)
states: 1
abstracting: (1<=p341)
states: 1
abstracting: (p242<=p233)
states: 373,996,882 (8)
abstracting: (p271<=1)
states: 373,996,883 (8)
abstracting: (1<=p44)
states: 1
abstracting: (p278<=0)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.529sec
checking: AG [[p157<=p55 | [[1<=p27 & [[~ [p114<=1] & ~ [[[p117<=0 | p137<=1] | [[p86<=p293 | p316<=p159] | [1<=p238 | 1<=p334]]]]] & ~ [p321<=1]]] & ~ [[~ [[[p342<=p87 | 1<=p114] & 1<=p360]] | 1<=p34]]]]]
normalized: ~ [E [true U ~ [[p157<=p55 | [~ [[1<=p34 | ~ [[1<=p360 & [p342<=p87 | 1<=p114]]]]] & [1<=p27 & [~ [p321<=1] & [~ [[[[1<=p238 | 1<=p334] | [p86<=p293 | p316<=p159]] | [p117<=0 | p137<=1]]] & ~ [p114<=1]]]]]]]]]
abstracting: (p114<=1)
states: 373,996,883 (8)
abstracting: (p137<=1)
states: 373,996,883 (8)
abstracting: (p117<=0)
states: 373,996,882 (8)
abstracting: (p316<=p159)
states: 373,996,882 (8)
abstracting: (p86<=p293)
states: 373,996,882 (8)
abstracting: (1<=p334)
states: 1
abstracting: (1<=p238)
states: 1
abstracting: (p321<=1)
states: 373,996,883 (8)
abstracting: (1<=p27)
states: 1
abstracting: (1<=p114)
states: 262,144 (5)
abstracting: (p342<=p87)
states: 373,996,882 (8)
abstracting: (1<=p360)
states: 40,353,607 (7)
abstracting: (1<=p34)
states: 51,883,209 (7)
abstracting: (p157<=p55)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.146sec
checking: EF [[[~ [[[[[[p229<=0 & [p133<=1 & p343<=1]] & ~ [1<=p304]] | p155<=p262] | p37<=p189] | [~ [p347<=1] | [~ [[[p1<=0 & p247<=0] | p160<=p220]] | ~ [[p219<=0 | p78<=p359]]]]]] & p142<=p79] | 1<=p316]]
normalized: E [true U [1<=p316 | [p142<=p79 & ~ [[[[~ [[p219<=0 | p78<=p359]] | ~ [[p160<=p220 | [p1<=0 & p247<=0]]]] | ~ [p347<=1]] | [p37<=p189 | [p155<=p262 | [~ [1<=p304] & [p229<=0 & [p133<=1 & p343<=1]]]]]]]]]]
abstracting: (p343<=1)
states: 373,996,883 (8)
abstracting: (p133<=1)
states: 373,996,883 (8)
abstracting: (p229<=0)
states: 373,996,882 (8)
abstracting: (1<=p304)
states: 1
abstracting: (p155<=p262)
states: 373,996,882 (8)
abstracting: (p37<=p189)
states: 372,043,758 (8)
abstracting: (p347<=1)
states: 373,996,883 (8)
abstracting: (p247<=0)
states: 322,113,674 (8)
abstracting: (p1<=0)
states: 372,043,758 (8)
abstracting: (p160<=p220)
states: 373,996,882 (8)
abstracting: (p78<=p359)
states: 373,734,739 (8)
abstracting: (p219<=0)
states: 372,043,758 (8)
abstracting: (p142<=p79)
states: 322,113,674 (8)
abstracting: (1<=p316)
states: 1
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.404sec
checking: AG [[p357<=0 | [[1<=p342 | [[[1<=p109 | [p334<=p343 | ~ [p39<=1]]] | [[1<=p300 & [p283<=p107 & [p160<=p264 | 1<=p330]]] | [[[p316<=0 | p63<=1] | ~ [p340<=1]] | [[1<=p238 | 1<=p310] | 1<=p185]]]] | 1<=p331]] & [p55<=p274 & p134<=p148]]]]
normalized: ~ [E [true U ~ [[p357<=0 | [[p55<=p274 & p134<=p148] & [1<=p342 | [1<=p331 | [[[[1<=p185 | [1<=p238 | 1<=p310]] | [~ [p340<=1] | [p316<=0 | p63<=1]]] | [1<=p300 & [p283<=p107 & [p160<=p264 | 1<=p330]]]] | [1<=p109 | [p334<=p343 | ~ [p39<=1]]]]]]]]]]]
abstracting: (p39<=1)
states: 373,996,883 (8)
abstracting: (p334<=p343)
states: 373,996,882 (8)
abstracting: (1<=p109)
states: 1,953,125 (6)
abstracting: (1<=p330)
states: 262,144 (5)
abstracting: (p160<=p264)
states: 373,996,882 (8)
abstracting: (p283<=p107)
states: 329,525,561 (8)
abstracting: (1<=p300)
states: 1
abstracting: (p63<=1)
states: 373,996,883 (8)
abstracting: (p316<=0)
states: 373,996,882 (8)
abstracting: (p340<=1)
states: 373,996,883 (8)
abstracting: (1<=p310)
states: 1
abstracting: (1<=p238)
states: 1
abstracting: (1<=p185)
states: 262,144 (5)
abstracting: (1<=p331)
states: 262,144 (5)
abstracting: (1<=p342)
states: 1
abstracting: (p134<=p148)
states: 373,996,882 (8)
abstracting: (p55<=p274)
states: 373,996,882 (8)
abstracting: (p357<=0)
states: 333,643,276 (8)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.985sec
checking: AG [[~ [[[p124<=1 | ~ [[[p54<=p32 & 1<=p354] & [p113<=p150 & p100<=p21]]]] & [~ [[[[1<=p41 | p97<=p241] | ~ [p155<=p239]] | ~ [p200<=0]]] & [[[1<=p280 | [p355<=p314 | p179<=p134]] | [~ [p276<=p208] | ~ [p233<=p98]]] & p66<=0]]]] | [p222<=p353 & p253<=1]]]
normalized: ~ [E [true U ~ [[[p222<=p353 & p253<=1] | ~ [[[[p66<=0 & [[~ [p233<=p98] | ~ [p276<=p208]] | [1<=p280 | [p355<=p314 | p179<=p134]]]] & ~ [[~ [p200<=0] | [~ [p155<=p239] | [1<=p41 | p97<=p241]]]]] & [p124<=1 | ~ [[[p113<=p150 & p100<=p21] & [p54<=p32 & 1<=p354]]]]]]]]]]
abstracting: (1<=p354)
states: 42,569,072 (7)
abstracting: (p54<=p32)
states: 373,996,882 (8)
abstracting: (p100<=p21)
states: 373,996,882 (8)
abstracting: (p113<=p150)
states: 373,800,275 (8)
abstracting: (p124<=1)
states: 373,996,883 (8)
abstracting: (p97<=p241)
states: 373,996,882 (8)
abstracting: (1<=p41)
states: 262,144 (5)
abstracting: (p155<=p239)
states: 373,996,882 (8)
abstracting: (p200<=0)
states: 373,996,882 (8)
abstracting: (p179<=p134)
states: 322,113,674 (8)
abstracting: (p355<=p314)
states: 333,643,276 (8)
abstracting: (1<=p280)
states: 1
abstracting: (p276<=p208)
states: 373,996,882 (8)
abstracting: (p233<=p98)
states: 373,996,882 (8)
abstracting: (p66<=0)
states: 319,898,209 (8)
abstracting: (p253<=1)
states: 373,996,883 (8)
abstracting: (p222<=p353)
states: 373,734,739 (8)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.679sec
checking: AG [[~ [[[p124<=p354 & 1<=p55] & [p349<=0 & [~ [1<=p80] & p112<=1]]]] | ~ [[[p71<=0 | [~ [[[p129<=0 | p35<=p222] & [1<=p1 & p295<=p330]]] & ~ [[[p274<=p116 | p94<=0] & ~ [1<=p308]]]]] | [[[~ [p53<=0] | 1<=p290] | [~ [[p284<=p179 | p358<=p205]] & [[1<=p179 | p51<=1] | ~ [1<=p362]]]] & [[p229<=1 | [~ [p293<=p363] | [p100<=1 | p246<=p188]]] | ~ [p230<=p140]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[~ [p230<=p140] | [p229<=1 | [[p100<=1 | p246<=p188] | ~ [p293<=p363]]]] & [[[~ [1<=p362] | [1<=p179 | p51<=1]] & ~ [[p284<=p179 | p358<=p205]]] | [1<=p290 | ~ [p53<=0]]]] | [p71<=0 | [~ [[~ [1<=p308] & [p274<=p116 | p94<=0]]] & ~ [[[1<=p1 & p295<=p330] & [p129<=0 | p35<=p222]]]]]]] | ~ [[[p349<=0 & [p112<=1 & ~ [1<=p80]]] & [p124<=p354 & 1<=p55]]]]]]]
abstracting: (1<=p55)
states: 1
abstracting: (p124<=p354)
states: 373,996,883 (8)
abstracting: (1<=p80)
states: 1
abstracting: (p112<=1)
states: 373,996,883 (8)
abstracting: (p349<=0)
states: 373,996,882 (8)
abstracting: (p35<=p222)
states: 322,113,674 (8)
abstracting: (p129<=0)
states: 373,996,882 (8)
abstracting: (p295<=p330)
states: 373,800,275 (8)
abstracting: (1<=p1)
states: 1,953,125 (6)
abstracting: (p94<=0)
states: 373,996,882 (8)
abstracting: (p274<=p116)
states: 373,996,882 (8)
abstracting: (1<=p308)
states: 1
abstracting: (p71<=0)
states: 322,113,674 (8)
abstracting: (p53<=0)
states: 373,996,882 (8)
abstracting: (1<=p290)
states: 1,953,125 (6)
abstracting: (p358<=p205)
states: 333,643,276 (8)
abstracting: (p284<=p179)
states: 329,525,561 (8)
abstracting: (p51<=1)
states: 373,996,883 (8)
abstracting: (1<=p179)
states: 51,883,209 (7)
abstracting: (1<=p362)
states: 40,353,607 (7)
abstracting: (p293<=p363)
states: 373,996,883 (8)
abstracting: (p246<=p188)
states: 319,898,210 (8)
abstracting: (p100<=1)
states: 373,996,883 (8)
abstracting: (p229<=1)
states: 373,996,883 (8)
abstracting: (p230<=p140)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m24.533sec
checking: AG [[p8<=0 | [[[p185<=0 & ~ [[[~ [1<=p263] | [[1<=p134 | p191<=0] & [p91<=0 & p17<=p48]]] | [[[p214<=p265 | p223<=1] | ~ [p315<=p183]] & ~ [[p52<=p56 & p316<=p77]]]]]] & ~ [[[[p171<=p28 & ~ [[p5<=0 & p97<=0]]] | p220<=p330] | [[~ [p269<=1] | p116<=p150] | [[1<=p301 & [p43<=p175 | 1<=p152]] | [[1<=p250 & p93<=1] & [1<=p201 & 1<=p164]]]]]]] | [p119<=0 & ~ [p43<=1]]]]]
normalized: ~ [E [true U ~ [[p8<=0 | [[p119<=0 & ~ [p43<=1]] | [~ [[[[[[1<=p201 & 1<=p164] & [1<=p250 & p93<=1]] | [1<=p301 & [p43<=p175 | 1<=p152]]] | [p116<=p150 | ~ [p269<=1]]] | [p220<=p330 | [p171<=p28 & ~ [[p5<=0 & p97<=0]]]]]] & [p185<=0 & ~ [[[~ [[p52<=p56 & p316<=p77]] & [~ [p315<=p183] | [p214<=p265 | p223<=1]]] | [[[p91<=0 & p17<=p48] & [1<=p134 | p191<=0]] | ~ [1<=p263]]]]]]]]]]]
abstracting: (1<=p263)
states: 1
abstracting: (p191<=0)
states: 373,996,882 (8)
abstracting: (1<=p134)
states: 1
abstracting: (p17<=p48)
states: 373,996,882 (8)
abstracting: (p91<=0)
states: 373,996,882 (8)
abstracting: (p223<=1)
states: 373,996,883 (8)
abstracting: (p214<=p265)
states: 322,113,674 (8)
abstracting: (p315<=p183)
states: 373,996,882 (8)
abstracting: (p316<=p77)
states: 373,996,882 (8)
abstracting: (p52<=p56)
states: 373,996,882 (8)
abstracting: (p185<=0)
states: 373,734,739 (8)
abstracting: (p97<=0)
states: 373,996,882 (8)
abstracting: (p5<=0)
states: 373,734,739 (8)
abstracting: (p171<=p28)
states: 373,996,882 (8)
abstracting: (p220<=p330)
states: 372,043,758 (8)
abstracting: (p269<=1)
states: 373,996,883 (8)
abstracting: (p116<=p150)
states: 373,996,882 (8)
abstracting: (1<=p152)
states: 1
abstracting: (p43<=p175)
states: 373,734,739 (8)
abstracting: (1<=p301)
states: 1
abstracting: (p93<=1)
states: 373,996,883 (8)
abstracting: (1<=p250)
states: 51,883,209 (7)
abstracting: (1<=p164)
states: 1
abstracting: (1<=p201)
states: 1
abstracting: (p43<=1)
states: 373,996,883 (8)
abstracting: (p119<=0)
states: 373,996,882 (8)
abstracting: (p8<=0)
states: 373,996,882 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.232sec
checking: AG [~ [[[~ [[[[[p356<=p357 & p121<=0] | ~ [p141<=0]] | ~ [[p290<=0 & 1<=p290]]] & p232<=p264]] | [~ [p79<=0] | ~ [[[[p194<=1 | p205<=1] & p273<=p35] | [~ [p231<=0] | ~ [p204<=p109]]]]]] & [[~ [[p186<=1 | ~ [[1<=p30 | 1<=p267]]]] & [p27<=1 | ~ [p69<=p66]]] | [~ [[p246<=p203 & p242<=1]] & [~ [[p350<=p290 & [1<=p282 | 1<=p230]]] | [~ [[1<=p266 & 1<=p53]] & [[p265<=p321 & p235<=0] & [p321<=1 & p98<=0]]]]]]]]]
normalized: ~ [E [true U [[[[[[[p321<=1 & p98<=0] & [p265<=p321 & p235<=0]] & ~ [[1<=p266 & 1<=p53]]] | ~ [[p350<=p290 & [1<=p282 | 1<=p230]]]] & ~ [[p246<=p203 & p242<=1]]] | [[p27<=1 | ~ [p69<=p66]] & ~ [[p186<=1 | ~ [[1<=p30 | 1<=p267]]]]]] & [[~ [[[~ [p204<=p109] | ~ [p231<=0]] | [p273<=p35 & [p194<=1 | p205<=1]]]] | ~ [p79<=0]] | ~ [[p232<=p264 & [~ [[p290<=0 & 1<=p290]] | [~ [p141<=0] | [p356<=p357 & p121<=0]]]]]]]]]
abstracting: (p121<=0)
states: 373,996,882 (8)
abstracting: (p356<=p357)
states: 333,643,276 (8)
abstracting: (p141<=0)
states: 322,113,674 (8)
abstracting: (1<=p290)
states: 1,953,125 (6)
abstracting: (p290<=0)
states: 372,043,758 (8)
abstracting: (p232<=p264)
states: 373,996,882 (8)
abstracting: (p79<=0)
states: 373,734,739 (8)
abstracting: (p205<=1)
states: 373,996,883 (8)
abstracting: (p194<=1)
states: 373,996,883 (8)
abstracting: (p273<=p35)
states: 373,996,882 (8)
abstracting: (p231<=0)
states: 373,996,882 (8)
abstracting: (p204<=p109)
states: 373,996,882 (8)
abstracting: (1<=p267)
states: 1
abstracting: (1<=p30)
states: 54,098,674 (7)
abstracting: (p186<=1)
states: 373,996,883 (8)
abstracting: (p69<=p66)
states: 322,113,674 (8)
abstracting: (p27<=1)
states: 373,996,883 (8)
abstracting: (p242<=1)
states: 373,996,883 (8)
abstracting: (p246<=p203)
states: 319,898,210 (8)
abstracting: (1<=p230)
states: 1
abstracting: (1<=p282)
states: 54,098,674 (7)
abstracting: (p350<=p290)
states: 373,996,882 (8)
abstracting: (1<=p53)
states: 1
abstracting: (1<=p266)
states: 1
abstracting: (p235<=0)
states: 373,996,882 (8)
abstracting: (p265<=p321)
states: 373,996,882 (8)
abstracting: (p98<=0)
states: 373,996,882 (8)
abstracting: (p321<=1)
states: 373,996,883 (8)
-> the formula is FALSE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.112sec
totally nodes used: 39174322 (3.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 111026998 637202473 748229471
used/not used/entry size/cache size: 67095649 13215 16 1024MB
basic ops cache: hits/miss/sum: 25837266 137639318 163476584
used/not used/entry size/cache size: 16763425 13791 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: 557681 3264420 3822101
used/not used/entry size/cache size: 2706211 5682397 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 40506512
1 17379152
2 6615039
3 2008000
4 483722
5 96204
6 17003
7 2755
8 418
9 53
>= 10 6
Total processing time: 9m30.790sec
BK_STOP 1679496907790
--------------------
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 ReachabilityCardinality -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.789sec
317694 342582 342934 343089 343482 343675 344019 344133 344577 345106 345739 345757 346095 346781 347320 347351 348043 348518 348538 349319 349678 349699 350150 350513 350521 351198 352541 352564 353952 353995 355062 355086 356459 357283 357301 358203 358233 359039 359047 360132 360206 361148 362244 362283 363256 363295 364486 364560 365502 365558 366616 366702 367661 367685 368937 369012 369818 369873 370776 370861 371680 371691 372650 372757 373558 373619 374480 374521 375386 375391 375368 375957 376056 378495 378584 381118 381230 383535 383571 386138 386170 388416 388440 388512 390774 390840 393107 393119 393103 395531 395650 397354 397399 399232 399269 401125 401134 401129 402928 402948 404821 404832 404873 406642 406660 406901 408539 408530 408364 409686 409827 412885 412956 413199 416198 416347 419436 419459 419576 422757 422839 426051 426063 426123 429315 429329 429523 432744 432760 432768 435807 435830 436175 439095 439143 439395 442344 442393 442771 445757 445788 445864 448712 448769 449203 452127 452188 452424 455245 455286 455552 458656 458659 458538 458319
iterations count:15544116 (308), effective:2006 (0)
initing FirstDep: 0m 0.752sec
445058 450308 453699
iterations count:386676 (7), effective:343 (0)
445058 450308 453699
iterations count:386351 (7), effective:343 (0)
445058 450308 453699
iterations count:386912 (7), effective:343 (0)
445058 450308 453699
iterations count:386721 (7), effective:343 (0)
445058 450308 453699
iterations count:386625 (7), effective:343 (0)
445058 450308 453699
iterations count:386685 (7), effective:343 (0)
445058 450308 453699
iterations count:386902 (7), effective:343 (0)
445058 449689 452117
iterations count:392119 (7), effective:343 (0)
445058 450308 453699
iterations count:386779 (7), effective:343 (0)
445058 450308 453699
iterations count:386572 (7), effective:343 (0)
445058 450308 453699
iterations count:386564 (7), effective:343 (0)
445058 450308 453699
iterations count:386970 (7), effective:343 (0)
445058 450308 453699
iterations count:386986 (7), effective:344 (0)
451021 454492 456006
iterations count:357773 (7), effective:344 (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="StigmergyCommit-PT-09a"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650400510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;