fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814483400958
Last Updated
May 14, 2023

About the Execution of Marcie+red for DNAwalker-PT-11ringRR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5621.964 138828.00 148471.00 732.00 FFFTTFTFFTFTFTFT 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.r106-tall-167814483400958.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 DNAwalker-PT-11ringRR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483400958
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:59 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.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-11ringRR-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678500572070

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=DNAwalker-PT-11ringRR
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 02:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:09:33] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-11 02:09:33] [INFO ] Transformed 27 places.
[2023-03-11 02:09:33] [INFO ] Transformed 260 transitions.
[2023-03-11 02:09:33] [INFO ] Parsed PT model containing 27 places and 260 transitions and 760 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 794 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 12) seen :4
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 02:09:34] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2023-03-11 02:09:34] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-11 02:09:34] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 02:09:59] [INFO ] After 24944ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-11 02:09:59] [INFO ] State equation strengthened by 70 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-11 02:09:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:09:59] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 258
Applied a total of 2 rules in 19 ms. Remains 27 /27 variables (removed 0) and now considering 258/260 (removed 2) transitions.
// Phase 1: matrix 258 rows 27 cols
[2023-03-11 02:09:59] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-11 02:10:00] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 27/27 places, 258/260 transitions.
Incomplete random walk after 10000 steps, including 800 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 957825 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 957825 steps, saw 127826 distinct states, run finished after 3002 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 02:10:03] [INFO ] Invariant cache hit.
[2023-03-11 02:10:03] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 02:10:28] [INFO ] After 24977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:10:28] [INFO ] State equation strengthened by 69 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-11 02:10:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:10:28] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 27 /27 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 27/27 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 27 /27 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2023-03-11 02:10:28] [INFO ] Invariant cache hit.
[2023-03-11 02:10:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 02:10:28] [INFO ] Invariant cache hit.
[2023-03-11 02:10:28] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-11 02:10:28] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-11 02:10:28] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 02:10:28] [INFO ] Invariant cache hit.
[2023-03-11 02:10:28] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 27/27 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-11 02:10:28] [INFO ] Invariant cache hit.
[2023-03-11 02:10:28] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 02:11:23] [INFO ] After 54216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-11 02:11:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-11 02:11:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 258 transitions and 756 arcs took 2 ms.
[2023-03-11 02:11:23] [INFO ] Flatten gal took : 37 ms
Total runtime 109658 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: DNAwalker_PT_11ringRR
(NrP: 27 NrTr: 258 NrArc: 756)

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

net check time: 0m 0.000sec

init dd package: 0m 2.798sec


RS generation: 0m21.015sec


-> reachability set: #nodes 12319 (1.2e+04) #states 28,209,796 (7)



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

checking: EF [[[p10<=0 & p20<=0] | [[p24<=p18 & [p10<=p23 & ~ [p25<=p11]]] & [[~ [2<=p2] & ~ [p15<=2]] & [~ [p11<=0] & [p9<=p4 | 1<=p22]]]]]]
normalized: E [true U [[[p24<=p18 & [p10<=p23 & ~ [p25<=p11]]] & [[[p9<=p4 | 1<=p22] & ~ [p11<=0]] & [~ [2<=p2] & ~ [p15<=2]]]] | [p10<=0 & p20<=0]]]

abstracting: (p20<=0)
states: 0
abstracting: (p10<=0)
states: 19,215,415 (7)
abstracting: (p15<=2)
states: 28,209,796 (7)
abstracting: (2<=p2)
states: 1,408,600 (6)
abstracting: (p11<=0)
states: 18,258,948 (7)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (p9<=p4)
states: 22,950,142 (7)
abstracting: (p25<=p11)
states: 21,430,976 (7)
abstracting: (p10<=p23)
states: 22,383,980 (7)
abstracting: (p24<=p18)
states: 23,908,124 (7)
-> the formula is FALSE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: AG [[[~ [p12<=p4] | p11<=0] | [p17<=2 | [[p23<=1 & [1<=p16 & ~ [p20<=0]]] & [~ [1<=p5] & [[~ [p2<=2] | p2<=2] & [~ [p22<=p23] | [~ [1<=p3] | ~ [p13<=p22]]]]]]]]]
normalized: ~ [E [true U ~ [[[p17<=2 | [[[[[~ [p13<=p22] | ~ [1<=p3]] | ~ [p22<=p23]] & [p2<=2 | ~ [p2<=2]]] & ~ [1<=p5]] & [p23<=1 & [1<=p16 & ~ [p20<=0]]]]] | [p11<=0 | ~ [p12<=p4]]]]]]

abstracting: (p12<=p4)
states: 23,878,356 (7)
abstracting: (p11<=0)
states: 18,258,948 (7)
abstracting: (p20<=0)
states: 0
abstracting: (1<=p16)
states: 8,833,102 (6)
abstracting: (p23<=1)
states: 27,269,198 (7)
abstracting: (1<=p5)
states: 14,645,876 (7)
abstracting: (p2<=2)
states: 28,209,796 (7)
abstracting: (p2<=2)
states: 28,209,796 (7)
abstracting: (p22<=p23)
states: 18,258,846 (7)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (p13<=p22)
states: 22,915,360 (7)
abstracting: (p17<=2)
states: 28,209,796 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: EF [[[[~ [p4<=2] & ~ [1<=p18]] & ~ [p16<=p7]] & [[2<=p22 & [~ [p11<=p16] | ~ [p10<=0]]] & [[~ [p7<=p6] | [p9<=1 & p8<=p0]] & [p4<=1 | [p9<=2 | p4<=p17]]]]]]
normalized: E [true U [[[[p4<=1 | [p9<=2 | p4<=p17]] & [[p9<=1 & p8<=p0] | ~ [p7<=p6]]] & [2<=p22 & [~ [p10<=0] | ~ [p11<=p16]]]] & [~ [p16<=p7] & [~ [1<=p18] & ~ [p4<=2]]]]]

abstracting: (p4<=2)
states: 28,209,796 (7)
abstracting: (1<=p18)
states: 14,714,388 (7)
abstracting: (p16<=p7)
states: 23,833,192 (7)
abstracting: (p11<=p16)
states: 21,064,666 (7)
abstracting: (p10<=0)
states: 19,215,415 (7)
abstracting: (2<=p22)
states: 1,403,292 (6)
abstracting: (p7<=p6)
states: 26,810,440 (7)
abstracting: (p8<=p0)
states: 13,538,129 (7)
abstracting: (p9<=1)
states: 27,271,258 (7)
abstracting: (p4<=p17)
states: 20,384,144 (7)
abstracting: (p9<=2)
states: 28,209,796 (7)
abstracting: (p4<=1)
states: 26,796,848 (7)
-> the formula is FALSE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: EF [[[[~ [p15<=2] & ~ [p0<=p21]] & [2<=p0 & p1<=p6]] & [[[~ [p1<=0] | [[2<=p19 & [~ [2<=p7] | [~ [p14<=p6] & ~ [p26<=p16]]]] | [p26<=p4 & p7<=1]]] & [~ [p17<=p7] | ~ [p24<=p20]]] & [[p12<=2 | p26<=p0] & [~ [1<=p20] | 2<=p2]]]]]
normalized: E [true U [[[[2<=p2 | ~ [1<=p20]] & [p12<=2 | p26<=p0]] & [[~ [p24<=p20] | ~ [p17<=p7]] & [[[p26<=p4 & p7<=1] | [2<=p19 & [[~ [p26<=p16] & ~ [p14<=p6]] | ~ [2<=p7]]]] | ~ [p1<=0]]]] & [[2<=p0 & p1<=p6] & [~ [p0<=p21] & ~ [p15<=2]]]]]

abstracting: (p15<=2)
states: 28,209,796 (7)
abstracting: (p0<=p21)
states: 28,209,067 (7)
abstracting: (p1<=p6)
states: 26,834,258 (7)
abstracting: (2<=p0)
states: 729
abstracting: (p1<=0)
states: 14,155,640 (7)
abstracting: (2<=p7)
states: 1,399,356 (6)
abstracting: (p14<=p6)
states: 28,209,796 (7)
abstracting: (p26<=p16)
states: 21,997,534 (7)
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (p7<=1)
states: 26,810,440 (7)
abstracting: (p26<=p4)
states: 23,888,433 (7)
abstracting: (p17<=p7)
states: 20,406,052 (7)
abstracting: (p24<=p20)
states: 28,209,796 (7)
abstracting: (p26<=p0)
states: 19,186,309 (7)
abstracting: (p12<=2)
states: 28,209,796 (7)
abstracting: (1<=p20)
states: 28,209,796 (7)
abstracting: (2<=p2)
states: 1,408,600 (6)
-> the formula is FALSE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: AG [[[[[p23<=1 & ~ [2<=p14]] | [[p26<=2 | [p26<=p15 & [1<=p12 & [p22<=p10 | p1<=p13]]]] & [[~ [p3<=p1] | ~ [p10<=p11]] | [[[p11<=p21 & [p8<=p12 | p9<=2]] & [[p13<=p0 | p9<=2] & [~ [p7<=p23] | ~ [p26<=2]]]] | [~ [p4<=p3] & [~ [2<=p19] | ~ [1<=p11]]]]]]] | [~ [p23<=p22] & ~ [p16<=p7]]] | [p19<=p13 | ~ [2<=p9]]]]
normalized: ~ [E [true U ~ [[[p19<=p13 | ~ [2<=p9]] | [[~ [p16<=p7] & ~ [p23<=p22]] | [[[[[[~ [1<=p11] | ~ [2<=p19]] & ~ [p4<=p3]] | [[[~ [p26<=2] | ~ [p7<=p23]] & [p13<=p0 | p9<=2]] & [p11<=p21 & [p8<=p12 | p9<=2]]]] | [~ [p10<=p11] | ~ [p3<=p1]]] & [p26<=2 | [p26<=p15 & [1<=p12 & [p22<=p10 | p1<=p13]]]]] | [p23<=1 & ~ [2<=p14]]]]]]]]

abstracting: (2<=p14)
states: 0
abstracting: (p23<=1)
states: 27,269,198 (7)
abstracting: (p1<=p13)
states: 18,593,150 (7)
abstracting: (p22<=p10)
states: 17,803,422 (7)
abstracting: (1<=p12)
states: 9,011,068 (6)
abstracting: (p26<=p15)
states: 22,307,105 (7)
abstracting: (p26<=2)
states: 28,209,796 (7)
abstracting: (p3<=p1)
states: 20,098,308 (7)
abstracting: (p10<=p11)
states: 22,387,973 (7)
abstracting: (p9<=2)
states: 28,209,796 (7)
abstracting: (p8<=p12)
states: 17,782,984 (7)
abstracting: (p11<=p21)
states: 22,849,684 (7)
abstracting: (p9<=2)
states: 28,209,796 (7)
abstracting: (p13<=p0)
states: 18,274,435 (7)
abstracting: (p7<=p23)
states: 18,373,063 (7)
abstracting: (p26<=2)
states: 28,209,796 (7)
abstracting: (p4<=p3)
states: 20,440,648 (7)
abstracting: (2<=p19)
states: 1,411,838 (6)
abstracting: (1<=p11)
states: 9,950,848 (6)
abstracting: (p23<=p22)
states: 22,913,561 (7)
abstracting: (p16<=p7)
states: 23,833,192 (7)
abstracting: (2<=p9)
states: 938,538 (5)
abstracting: (p19<=p13)
states: 18,211,042 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: EF [[[~ [p0<=p4] & [~ [2<=p22] & ~ [p14<=p13]]] & [[~ [1<=p8] & [[~ [p11<=2] | [p4<=p21 | [1<=p12 & ~ [p18<=p11]]]] | [[~ [p21<=p15] & ~ [p1<=1]] | [[[p3<=p0 & p17<=0] & [~ [p12<=2] & [2<=p7 & [[2<=p24 | 1<=p3] | [~ [p10<=2] | [p14<=2 & [1<=p21 & ~ [p17<=2]]]]]]]] | [~ [p6<=0] & ~ [p21<=p5]]]]]] & [[~ [p18<=2] | [[~ [p14<=p22] & p14<=0] & [~ [p18<=0] & [~ [p12<=p24] & ~ [1<=p22]]]]] & [[p19<=p8 & [~ [p23<=p5] | [~ [p26<=p3] | ~ [p12<=2]]]] | [[2<=p8 & ~ [2<=p3]] & [~ [2<=p10] & [~ [2<=p4] & ~ [p21<=1]]]]]]]]]
normalized: E [true U [[[[[[[~ [p21<=1] & ~ [2<=p4]] & ~ [2<=p10]] & [2<=p8 & ~ [2<=p3]]] | [p19<=p8 & [[~ [p12<=2] | ~ [p26<=p3]] | ~ [p23<=p5]]]] & [[[[~ [1<=p22] & ~ [p12<=p24]] & ~ [p18<=0]] & [p14<=0 & ~ [p14<=p22]]] | ~ [p18<=2]]] & [[[[[~ [p21<=p5] & ~ [p6<=0]] | [[[2<=p7 & [[[p14<=2 & [1<=p21 & ~ [p17<=2]]] | ~ [p10<=2]] | [2<=p24 | 1<=p3]]] & ~ [p12<=2]] & [p3<=p0 & p17<=0]]] | [~ [p1<=1] & ~ [p21<=p15]]] | [[p4<=p21 | [1<=p12 & ~ [p18<=p11]]] | ~ [p11<=2]]] & ~ [1<=p8]]] & [[~ [p14<=p13] & ~ [2<=p22]] & ~ [p0<=p4]]]]

abstracting: (p0<=p4)
states: 28,209,067 (7)
abstracting: (2<=p22)
states: 1,403,292 (6)
abstracting: (p14<=p13)
states: 19,216,524 (7)
abstracting: (1<=p8)
states: 14,672,396 (7)
abstracting: (p11<=2)
states: 28,209,796 (7)
abstracting: (p18<=p11)
states: 18,207,720 (7)
abstracting: (1<=p12)
states: 9,011,068 (6)
abstracting: (p4<=p21)
states: 20,297,216 (7)
abstracting: (p21<=p15)
states: 18,263,896 (7)
abstracting: (p1<=1)
states: 26,834,258 (7)
abstracting: (p17<=0)
states: 13,603,188 (7)
abstracting: (p3<=p0)
states: 13,595,341 (7)
abstracting: (p12<=2)
states: 28,209,796 (7)
abstracting: (1<=p3)
states: 14,615,184 (7)
abstracting: (2<=p24)
states: 0
abstracting: (p10<=2)
states: 28,209,796 (7)
abstracting: (p17<=2)
states: 28,209,796 (7)
abstracting: (1<=p21)
states: 14,397,124 (7)
abstracting: (p14<=2)
states: 28,209,796 (7)
abstracting: (2<=p7)
states: 1,399,356 (6)
abstracting: (p6<=0)
states: 0
abstracting: (p21<=p5)
states: 20,529,570 (7)
abstracting: (p18<=2)
states: 28,209,796 (7)
abstracting: (p14<=p22)
states: 23,857,692 (7)
abstracting: (p14<=0)
states: 19,216,524 (7)
abstracting: (p18<=0)
states: 13,495,408 (7)
abstracting: (p12<=p24)
states: 22,062,242 (7)
abstracting: (1<=p22)
states: 14,584,608 (7)
abstracting: (p23<=p5)
states: 22,945,532 (7)
abstracting: (p26<=p3)
states: 23,839,684 (7)
abstracting: (p12<=2)
states: 28,209,796 (7)
abstracting: (p19<=p8)
states: 20,423,582 (7)
abstracting: (2<=p3)
states: 1,408,600 (6)
abstracting: (2<=p8)
states: 1,404,612 (6)
abstracting: (2<=p10)
states: 0
abstracting: (2<=p4)
states: 1,412,948 (6)
abstracting: (p21<=1)
states: 26,811,886 (7)
-> the formula is FALSE

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

totally nodes used: 1891264 (1.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 87539011 74021881 161560892
used/not used/entry size/cache size: 43254850 23854014 16 1024MB
basic ops cache: hits/miss/sum: 2128008 1336117 3464125
used/not used/entry size/cache size: 1944128 14833088 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: 206960 173970 380930
used/not used/entry size/cache size: 172560 8216048 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 65347985
1 1664161
2 76185
3 13600
4 4112
5 1449
6 667
7 339
8 137
9 90
>= 10 139

Total processing time: 0m26.602sec


BK_STOP 1678500710898

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

966 1163 1333 1386 1343 1550 1530 1805 1524 1351 3467 13256 11563 12097 12809 12716 14199 13337 14015 14806 13463 12741
iterations count:2207380 (8555), effective:50775 (196)

initing FirstDep: 0m 0.000sec

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="DNAwalker-PT-11ringRR"
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 DNAwalker-PT-11ringRR, 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 r106-tall-167814483400958"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-11ringRR.tgz
mv DNAwalker-PT-11ringRR 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;