Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696200758.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696200758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30M 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 CANInsertWithFailure-PT-070-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678748615952

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=CANInsertWithFailure-PT-070
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 23:03:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:03:38] [INFO ] Load time of PNML (sax parser for PT used): 753 ms
[2023-03-13 23:03:38] [INFO ] Transformed 10644 places.
[2023-03-13 23:03:38] [INFO ] Transformed 29820 transitions.
[2023-03-13 23:03:38] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 974 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 29820 rows 10644 cols
[2023-03-13 23:03:44] [INFO ] Computed 73 place invariants in 4741 ms
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using 71 positive place invariants in 200 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 264 ms returned sat
[2023-03-13 23:03:50] [INFO ] After 5016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 23:03:54] [INFO ] [Nat]Absence check using 71 positive place invariants in 174 ms returned sat
[2023-03-13 23:03:54] [INFO ] [Nat]Absence check using 71 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-13 23:04:15] [INFO ] After 18673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 23:04:15] [INFO ] State equation strengthened by 9730 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-13 23:04:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:04:15] [INFO ] After 25303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 157 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.47 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 464 transitions
Trivial Post-agglo rules discarded 464 transitions
Performed 464 trivial Post agglomeration. Transition count delta: 464
Iterating post reduction 0 with 464 rules applied. Total rules applied 465 place count 10643 transition count 29356
Reduce places removed 464 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 473 rules applied. Total rules applied 938 place count 10179 transition count 29347
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 947 place count 10170 transition count 29347
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 947 place count 10170 transition count 29340
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 961 place count 10163 transition count 29340
Performed 4290 Post agglomeration using F-continuation condition.Transition count delta: 4290
Deduced a syphon composed of 4290 places in 20 ms
Reduce places removed 4290 places and 0 transitions.
Iterating global reduction 3 with 8580 rules applied. Total rules applied 9541 place count 5873 transition count 25050
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9543 place count 5873 transition count 25048
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 9545 place count 5871 transition count 25048
Partial Free-agglomeration rule applied 5756 times.
Drop transitions removed 5756 transitions
Iterating global reduction 4 with 5756 rules applied. Total rules applied 15301 place count 5871 transition count 25048
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 4 with 594 rules applied. Total rules applied 15895 place count 5871 transition count 25048
Applied a total of 15895 rules in 10575 ms. Remains 5871 /10644 variables (removed 4773) and now considering 25048/29820 (removed 4772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10581 ms. Remains : 5871/10644 places, 25048/29820 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 11) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 23:04:26] [INFO ] Flow matrix only has 24989 transitions (discarded 59 similar events)
// Phase 1: matrix 24989 rows 5871 cols
[2023-03-13 23:04:28] [INFO ] Computed 72 place invariants in 1387 ms
[2023-03-13 23:04:29] [INFO ] [Real]Absence check using 70 positive place invariants in 97 ms returned sat
[2023-03-13 23:04:29] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 106 ms returned sat
[2023-03-13 23:04:30] [INFO ] After 1808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 23:04:31] [INFO ] [Nat]Absence check using 70 positive place invariants in 100 ms returned sat
[2023-03-13 23:04:31] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 106 ms returned sat
[2023-03-13 23:04:46] [INFO ] After 13962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 23:04:46] [INFO ] State equation strengthened by 22942 read => feed constraints.
[2023-03-13 23:04:55] [INFO ] After 8338ms SMT Verify possible using 22942 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 23:04:55] [INFO ] After 8340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-13 23:04:55] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 111 out of 5871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5871/5871 places, 25048/25048 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5871 transition count 25047
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5870 transition count 25047
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 14 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 46 place count 5848 transition count 25025
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 5848 transition count 25023
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 5846 transition count 25023
Partial Free-agglomeration rule applied 229 times.
Drop transitions removed 229 transitions
Iterating global reduction 3 with 229 rules applied. Total rules applied 279 place count 5846 transition count 25023
Applied a total of 279 rules in 4316 ms. Remains 5846 /5871 variables (removed 25) and now considering 25023/25048 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4316 ms. Remains : 5846/5871 places, 25023/25048 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 101402 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101402 steps, saw 96356 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-13 23:05:03] [INFO ] Flow matrix only has 24979 transitions (discarded 44 similar events)
// Phase 1: matrix 24979 rows 5846 cols
[2023-03-13 23:05:05] [INFO ] Computed 72 place invariants in 1434 ms
[2023-03-13 23:05:06] [INFO ] [Real]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-13 23:05:06] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 138 ms returned sat
[2023-03-13 23:05:07] [INFO ] After 1845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 23:05:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 88 ms returned sat
[2023-03-13 23:05:08] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 106 ms returned sat
[2023-03-13 23:05:22] [INFO ] After 12893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 23:05:23] [INFO ] State equation strengthened by 23434 read => feed constraints.
[2023-03-13 23:05:32] [INFO ] After 9127ms SMT Verify possible using 23434 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 23:05:32] [INFO ] After 9129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 23:05:32] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 111 out of 5846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5846/5846 places, 25023/25023 transitions.
Applied a total of 0 rules in 1109 ms. Remains 5846 /5846 variables (removed 0) and now considering 25023/25023 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 5846/5846 places, 25023/25023 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5846/5846 places, 25023/25023 transitions.
Applied a total of 0 rules in 988 ms. Remains 5846 /5846 variables (removed 0) and now considering 25023/25023 (removed 0) transitions.
[2023-03-13 23:05:34] [INFO ] Flow matrix only has 24979 transitions (discarded 44 similar events)
[2023-03-13 23:05:34] [INFO ] Invariant cache hit.
[2023-03-13 23:05:38] [INFO ] Implicit Places using invariants in 4535 ms returned []
Implicit Place search using SMT only with invariants took 4540 ms to find 0 implicit places.
[2023-03-13 23:05:38] [INFO ] Flow matrix only has 24979 transitions (discarded 44 similar events)
[2023-03-13 23:05:38] [INFO ] Invariant cache hit.
[2023-03-13 23:05:51] [INFO ] Dead Transitions using invariants and state equation in 12814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18357 ms. Remains : 5846/5846 places, 25023/25023 transitions.
Graph (trivial) has 22759 edges and 5846 vertex of which 4728 / 5846 are part of one of the 2 SCC in 8 ms
Free SCC test removed 4726 places
Drop transitions removed 16363 transitions
Ensure Unique test removed 4801 transitions
Reduce isomorphic transitions removed 21164 transitions.
Graph (complete) has 4382 edges and 1120 vertex of which 922 are kept as prefixes of interest. Removing 198 places using SCC suffix rule.1 ms
Discarding 198 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Drop transitions removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 737 rules applied. Total rules applied 739 place count 922 transition count 3062
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 745 place count 919 transition count 3059
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 745 place count 919 transition count 3054
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 755 place count 914 transition count 3054
Discarding 580 places :
Symmetric choice reduction at 2 with 580 rule applications. Total rules 1335 place count 334 transition count 1443
Iterating global reduction 2 with 580 rules applied. Total rules applied 1915 place count 334 transition count 1443
Ensure Unique test removed 453 transitions
Reduce isomorphic transitions removed 453 transitions.
Iterating post reduction 2 with 453 rules applied. Total rules applied 2368 place count 334 transition count 990
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2427 place count 275 transition count 872
Iterating global reduction 3 with 59 rules applied. Total rules applied 2486 place count 275 transition count 872
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 2545 place count 275 transition count 813
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2549 place count 273 transition count 811
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2551 place count 272 transition count 810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2552 place count 272 transition count 809
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 5 with 56 rules applied. Total rules applied 2608 place count 272 transition count 753
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 10 rules applied. Total rules applied 2618 place count 272 transition count 743
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 14 rules applied. Total rules applied 2632 place count 262 transition count 739
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2636 place count 258 transition count 739
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2641 place count 253 transition count 731
Iterating global reduction 8 with 5 rules applied. Total rules applied 2646 place count 253 transition count 731
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 2674 place count 239 transition count 717
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 2688 place count 239 transition count 703
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2692 place count 237 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2694 place count 237 transition count 700
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 2702 place count 237 transition count 692
Free-agglomeration rule applied 56 times with reduction of 5 identical transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 2758 place count 237 transition count 631
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 10 with 138 rules applied. Total rules applied 2896 place count 181 transition count 549
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 2905 place count 181 transition count 540
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2909 place count 181 transition count 540
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 2920 place count 177 transition count 533
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2921 place count 177 transition count 532
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 12 with 48 rules applied. Total rules applied 2969 place count 177 transition count 532
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 12 with 16 rules applied. Total rules applied 2985 place count 177 transition count 516
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2988 place count 174 transition count 511
Iterating global reduction 13 with 3 rules applied. Total rules applied 2991 place count 174 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2992 place count 174 transition count 510
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2996 place count 170 transition count 506
Applied a total of 2996 rules in 910 ms. Remains 170 /5846 variables (removed 5676) and now considering 506/25023 (removed 24517) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 506 rows 170 cols
[2023-03-13 23:05:52] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-13 23:05:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 23:05:52] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 23:05:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-13 23:05:53] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 23:05:53] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-13 23:05:53] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-13 23:05:53] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-13 23:05:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5846 places, 25023 transitions and 98755 arcs took 136 ms.
[2023-03-13 23:05:54] [INFO ] Flatten gal took : 789 ms
Total runtime 136726 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: gen
(NrP: 5846 NrTr: 25023 NrArc: 98755)

parse formulas
formulas created successfully
place and transition orderings generation:0m20.520sec

net check time: 0m 0.023sec

init dd package: 0m 3.030sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 8690984 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16052456 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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 2.046sec

69080 795800 720396 697855

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="CANInsertWithFailure-PT-070"
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 CANInsertWithFailure-PT-070, 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 r042-tajo-167813696200758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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