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-167813696100686.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-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 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 12M 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-090-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678741310103

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=CANConstruction-PT-090
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:01:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:01:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:01:55] [INFO ] Load time of PNML (sax parser for PT used): 1081 ms
[2023-03-13 21:01:56] [INFO ] Transformed 17282 places.
[2023-03-13 21:01:56] [INFO ] Transformed 33120 transitions.
[2023-03-13 21:01:56] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 1603 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 1132 ms. (steps per millisecond=8 ) properties (out of 16) seen :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 65703 steps, run timeout after 3006 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65703 steps, saw 64759 distinct states, run finished after 3008 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 33120 rows 17282 cols
[2023-03-13 21:02:01] [INFO ] Computed 181 place invariants in 711 ms
[2023-03-13 21:02:10] [INFO ] [Real]Absence check using 91 positive place invariants in 675 ms returned sat
[2023-03-13 21:02:11] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 273 ms returned sat
[2023-03-13 21:02:11] [INFO ] After 9975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 21:02:19] [INFO ] [Nat]Absence check using 91 positive place invariants in 701 ms returned sat
[2023-03-13 21:02:19] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 279 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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 21:02:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:02:36] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA CANConstruction-PT-090-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 119 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 613 transitions
Trivial Post-agglo rules discarded 613 transitions
Performed 613 trivial Post agglomeration. Transition count delta: 613
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 17282 transition count 32507
Reduce places removed 613 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 619 rules applied. Total rules applied 1232 place count 16669 transition count 32501
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1238 place count 16663 transition count 32501
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1238 place count 16663 transition count 32499
Deduced a syphon composed of 2 places in 46 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1242 place count 16661 transition count 32499
Discarding 7859 places :
Symmetric choice reduction at 3 with 7859 rule applications. Total rules 9101 place count 8802 transition count 16781
Iterating global reduction 3 with 7859 rules applied. Total rules applied 16960 place count 8802 transition count 16781
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 14 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 17132 place count 8716 transition count 16695
Free-agglomeration rule applied 90 times.
Iterating global reduction 3 with 90 rules applied. Total rules applied 17222 place count 8716 transition count 16605
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 3 with 90 rules applied. Total rules applied 17312 place count 8626 transition count 16605
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 17317 place count 8626 transition count 16600
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 17322 place count 8621 transition count 16600
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 5 with 90 rules applied. Total rules applied 17412 place count 8621 transition count 16600
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 17414 place count 8621 transition count 16600
Applied a total of 17414 rules in 20549 ms. Remains 8621 /17282 variables (removed 8661) and now considering 16600/33120 (removed 16520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20552 ms. Remains : 8621/17282 places, 16600/33120 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 11) seen :3
FORMULA CANConstruction-PT-090-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 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 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 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 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 26 ms. (steps per millisecond=384 ) 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.
// Phase 1: matrix 16600 rows 8621 cols
[2023-03-13 21:02:58] [INFO ] Computed 181 place invariants in 124 ms
[2023-03-13 21:03:00] [INFO ] [Real]Absence check using 91 positive place invariants in 261 ms returned sat
[2023-03-13 21:03:00] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 145 ms returned sat
[2023-03-13 21:03:01] [INFO ] After 2935ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 21:03:03] [INFO ] [Nat]Absence check using 91 positive place invariants in 226 ms returned sat
[2023-03-13 21:03:03] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 112 ms returned sat
[2023-03-13 21:03:17] [INFO ] After 12405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 21:03:17] [INFO ] State equation strengthened by 16238 read => feed constraints.
[2023-03-13 21:03:26] [INFO ] After 8692ms SMT Verify possible using 16238 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-13 21:03:26] [INFO ] After 8721ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-13 21:03:26] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA CANConstruction-PT-090-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA CANConstruction-PT-090-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 67 ms.
Support contains 62 out of 8621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8621/8621 places, 16600/16600 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8621 transition count 16598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8619 transition count 16598
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 8613 transition count 16586
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 8613 transition count 16586
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 64 place count 8589 transition count 16562
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 8584 transition count 16563
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 8584 transition count 16561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 8582 transition count 16561
Applied a total of 78 rules in 12022 ms. Remains 8582 /8621 variables (removed 39) and now considering 16561/16600 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12024 ms. Remains : 8582/8621 places, 16561/16600 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) seen :1
FORMULA CANConstruction-PT-090-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Running SMT prover for 1 properties.
// Phase 1: matrix 16561 rows 8582 cols
[2023-03-13 21:03:38] [INFO ] Computed 181 place invariants in 111 ms
[2023-03-13 21:03:39] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 21:03:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 177 ms returned sat
[2023-03-13 21:03:41] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 160 ms returned sat
[2023-03-13 21:03:51] [INFO ] After 10428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 21:03:51] [INFO ] State equation strengthened by 16273 read => feed constraints.
[2023-03-13 21:03:55] [INFO ] After 3279ms SMT Verify possible using 16273 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 21:03:56] [INFO ] After 4675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 944 ms.
[2023-03-13 21:03:57] [INFO ] After 17483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 20 out of 8582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8582/8582 places, 16561/16561 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 8559 transition count 16538
Applied a total of 46 rules in 5248 ms. Remains 8559 /8582 variables (removed 23) and now considering 16538/16561 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5249 ms. Remains : 8559/8582 places, 16538/16561 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 104323 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104323 steps, saw 91851 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16538 rows 8559 cols
[2023-03-13 21:04:05] [INFO ] Computed 181 place invariants in 106 ms
[2023-03-13 21:04:06] [INFO ] After 724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 21:04:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 196 ms returned sat
[2023-03-13 21:04:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 91 ms returned sat
[2023-03-13 21:04:17] [INFO ] After 9027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 21:04:17] [INFO ] State equation strengthened by 16296 read => feed constraints.
[2023-03-13 21:04:20] [INFO ] After 3286ms SMT Verify possible using 16296 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 21:04:22] [INFO ] After 4659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 693 ms.
[2023-03-13 21:04:22] [INFO ] After 16130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 20 out of 8559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8559/8559 places, 16538/16538 transitions.
Applied a total of 0 rules in 2700 ms. Remains 8559 /8559 variables (removed 0) and now considering 16538/16538 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2701 ms. Remains : 8559/8559 places, 16538/16538 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8559/8559 places, 16538/16538 transitions.
Applied a total of 0 rules in 2466 ms. Remains 8559 /8559 variables (removed 0) and now considering 16538/16538 (removed 0) transitions.
[2023-03-13 21:04:28] [INFO ] Invariant cache hit.
[2023-03-13 21:04:28] [INFO ] Implicit Places using invariants in 892 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
[2023-03-13 21:04:28] [INFO ] Invariant cache hit.
[2023-03-13 21:04:40] [INFO ] Dead Transitions using invariants and state equation in 11218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14584 ms. Remains : 8559/8559 places, 16538/16538 transitions.
Graph (trivial) has 16176 edges and 8559 vertex of which 8121 / 8559 are part of one of the 89 SCC in 14 ms
Free SCC test removed 8032 places
Drop transitions removed 15934 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 15946 transitions.
Graph (complete) has 1178 edges and 527 vertex of which 158 are kept as prefixes of interest. Removing 369 places using SCC suffix rule.1 ms
Discarding 369 places :
Also discarding 296 output transitions
Drop transitions removed 296 transitions
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 158 transition count 165
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 178 rules applied. Total rules applied 311 place count 69 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 313 place count 67 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 313 place count 67 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 325 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 60 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 330 place count 59 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 331 place count 58 transition count 67
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 57 transition count 66
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 57 transition count 66
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 5 with 2 rules applied. Total rules applied 335 place count 56 transition count 67
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 352 place count 56 transition count 67
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 367 place count 41 transition count 52
Iterating global reduction 5 with 15 rules applied. Total rules applied 382 place count 41 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 383 place count 40 transition count 51
Applied a total of 383 rules in 63 ms. Remains 40 /8559 variables (removed 8519) and now considering 51/16538 (removed 16487) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 40 cols
[2023-03-13 21:04:40] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-13 21:04:40] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 21:04:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-13 21:04:40] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 21:04:40] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 21:04:40] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 21:04:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 21:04:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8559 places, 16538 transitions and 66208 arcs took 65 ms.
[2023-03-13 21:04:41] [INFO ] Flatten gal took : 625 ms
Total runtime 166774 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: 8559 NrTr: 16538 NrArc: 66208)

parse formulas
formulas created successfully
place and transition orderings generation:0m17.023sec

net check time: 0m 0.014sec

init dd package: 0m 3.081sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6603932 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16075092 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 0.439sec

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-090"
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 CANConstruction-PT-090, 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-167813696100686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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