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-167813696100663.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 CANConstruction-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 5.4M 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 CANConstruction-PT-060-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678739341341

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:29:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:29:03] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2023-03-13 20:29:03] [INFO ] Transformed 7922 places.
[2023-03-13 20:29:03] [INFO ] Transformed 14880 transitions.
[2023-03-13 20:29:03] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 9 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
FORMULA CANConstruction-PT-060-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 8) 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 8) 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 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 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 14880 rows 7922 cols
[2023-03-13 20:29:04] [INFO ] Computed 121 place invariants in 204 ms
[2023-03-13 20:29:07] [INFO ] [Real]Absence check using 61 positive place invariants in 199 ms returned sat
[2023-03-13 20:29:07] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 171 ms returned sat
[2023-03-13 20:29:14] [INFO ] After 9987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 20:29:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 195 ms returned sat
[2023-03-13 20:29:17] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 131 ms returned sat
[2023-03-13 20:29:29] [INFO ] After 10857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 20:29:29] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-13 20:29:35] [INFO ] After 6658ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 20:29:54] [INFO ] Deduced a trap composed of 5 places in 14846 ms of which 24 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-13 20:29:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:29:54] [INFO ] After 39871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA CANConstruction-PT-060-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 217 ms.
Support contains 70 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 7922 transition count 14557
Reduce places removed 323 places and 0 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 1 with 385 rules applied. Total rules applied 708 place count 7599 transition count 14495
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 770 place count 7537 transition count 14495
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 770 place count 7537 transition count 14481
Deduced a syphon composed of 14 places in 6 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 798 place count 7523 transition count 14481
Discarding 3459 places :
Symmetric choice reduction at 3 with 3459 rule applications. Total rules 4257 place count 4064 transition count 7563
Iterating global reduction 3 with 3459 rules applied. Total rules applied 7716 place count 4064 transition count 7563
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 7808 place count 4018 transition count 7517
Free-agglomeration rule applied 85 times.
Iterating global reduction 3 with 85 rules applied. Total rules applied 7893 place count 4018 transition count 7432
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 3 with 85 rules applied. Total rules applied 7978 place count 3933 transition count 7432
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 4 with 45 rules applied. Total rules applied 8023 place count 3933 transition count 7432
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 8026 place count 3933 transition count 7432
Applied a total of 8026 rules in 4187 ms. Remains 3933 /7922 variables (removed 3989) and now considering 7432/14880 (removed 7448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4190 ms. Remains : 3933/7922 places, 7432/14880 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 64088 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{3=1}
Probabilistic random walk after 64088 steps, saw 44311 distinct states, run finished after 3014 ms. (steps per millisecond=21 ) properties seen :1
FORMULA CANConstruction-PT-060-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 7432 rows 3933 cols
[2023-03-13 20:30:02] [INFO ] Computed 121 place invariants in 83 ms
[2023-03-13 20:30:03] [INFO ] [Real]Absence check using 61 positive place invariants in 114 ms returned sat
[2023-03-13 20:30:03] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 48 ms returned sat
[2023-03-13 20:30:06] [INFO ] After 3867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:30:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 61 ms returned sat
[2023-03-13 20:30:07] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 30 ms returned sat
[2023-03-13 20:30:10] [INFO ] After 3444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:30:10] [INFO ] State equation strengthened by 7214 read => feed constraints.
[2023-03-13 20:30:13] [INFO ] After 2522ms SMT Verify possible using 7214 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:30:16] [INFO ] After 5180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1597 ms.
[2023-03-13 20:30:17] [INFO ] After 11283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
FORMULA CANConstruction-PT-060-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 27 ms.
Support contains 30 out of 3933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3933/3933 places, 7432/7432 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3933 transition count 7420
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 3921 transition count 7420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 3920 transition count 7418
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 3920 transition count 7418
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 60 place count 3903 transition count 7401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 3902 transition count 7401
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 3902 transition count 7393
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 78 place count 3894 transition count 7393
Applied a total of 78 rules in 2513 ms. Remains 3894 /3933 variables (removed 39) and now considering 7393/7432 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2513 ms. Remains : 3894/3933 places, 7393/7432 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 92570 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92570 steps, saw 52457 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7393 rows 3894 cols
[2023-03-13 20:30:23] [INFO ] Computed 121 place invariants in 45 ms
[2023-03-13 20:30:23] [INFO ] [Real]Absence check using 61 positive place invariants in 52 ms returned sat
[2023-03-13 20:30:23] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 28 ms returned sat
[2023-03-13 20:30:24] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:30:24] [INFO ] [Nat]Absence check using 61 positive place invariants in 47 ms returned sat
[2023-03-13 20:30:24] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 27 ms returned sat
[2023-03-13 20:30:26] [INFO ] After 2299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:30:26] [INFO ] State equation strengthened by 7225 read => feed constraints.
[2023-03-13 20:30:28] [INFO ] After 1170ms SMT Verify possible using 7225 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:30:28] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 370 ms.
[2023-03-13 20:30:28] [INFO ] After 4838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 3894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3894/3894 places, 7393/7393 transitions.
Applied a total of 0 rules in 649 ms. Remains 3894 /3894 variables (removed 0) and now considering 7393/7393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 3894/3894 places, 7393/7393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3894/3894 places, 7393/7393 transitions.
Applied a total of 0 rules in 514 ms. Remains 3894 /3894 variables (removed 0) and now considering 7393/7393 (removed 0) transitions.
[2023-03-13 20:30:30] [INFO ] Invariant cache hit.
[2023-03-13 20:30:32] [INFO ] Implicit Places using invariants in 2518 ms returned []
[2023-03-13 20:30:32] [INFO ] Invariant cache hit.
[2023-03-13 20:30:35] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 5100 ms to find 0 implicit places.
[2023-03-13 20:30:36] [INFO ] Redundant transitions in 879 ms returned []
[2023-03-13 20:30:36] [INFO ] Invariant cache hit.
[2023-03-13 20:30:39] [INFO ] Dead Transitions using invariants and state equation in 3454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9957 ms. Remains : 3894/3894 places, 7393/7393 transitions.
Graph (trivial) has 6917 edges and 3894 vertex of which 3294 / 3894 are part of one of the 54 SCC in 8 ms
Free SCC test removed 3240 places
Drop transitions removed 6416 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6417 transitions.
Graph (complete) has 1355 edges and 654 vertex of which 457 are kept as prefixes of interest. Removing 197 places using SCC suffix rule.1 ms
Discarding 197 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Ensure Unique test removed 6 places
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 451 transition count 695
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Iterating post reduction 1 with 470 rules applied. Total rules applied 657 place count 334 transition count 342
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Iterating post reduction 2 with 468 rules applied. Total rules applied 1125 place count 96 transition count 112
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1125 place count 96 transition count 103
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1143 place count 87 transition count 103
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1149 place count 81 transition count 97
Iterating global reduction 3 with 6 rules applied. Total rules applied 1155 place count 81 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1155 place count 81 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 80 transition count 96
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 3 with 2 rules applied. Total rules applied 1159 place count 79 transition count 95
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 3 with 2 rules applied. Total rules applied 1161 place count 78 transition count 94
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 1163 place count 78 transition count 92
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 1176 place count 78 transition count 79
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 1193 place count 63 transition count 77
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1195 place count 63 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1197 place count 61 transition count 75
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1202 place count 61 transition count 75
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1207 place count 56 transition count 70
Iterating global reduction 5 with 5 rules applied. Total rules applied 1212 place count 56 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1213 place count 55 transition count 69
Applied a total of 1213 rules in 100 ms. Remains 55 /3894 variables (removed 3839) and now considering 69/7393 (removed 7324) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 55 cols
[2023-03-13 20:30:39] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-13 20:30:39] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-03-13 20:30:39] [INFO ] [Real]Absence check using 12 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-13 20:30:39] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 20:30:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 20:30:39] [INFO ] [Nat]Absence check using 12 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 20:30:39] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 20:30:39] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-13 20:30:39] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 20:30:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 20:30:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3894 places, 7393 transitions and 29571 arcs took 36 ms.
[2023-03-13 20:30:40] [INFO ] Flatten gal took : 382 ms
Total runtime 97439 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 3894 NrTr: 7393 NrArc: 29571)

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

net check time: 0m 0.011sec

init dd package: 0m 2.987sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9117944 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16091696 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:
++ 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
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.083sec

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="CANConstruction-PT-060"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CANConstruction-PT-060, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696100663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-060.tgz
mv CANConstruction-PT-060 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;