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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 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 7.3M 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-070-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678739782319

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-070
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:36:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 20:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:36:24] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2023-03-13 20:36:24] [INFO ] Transformed 10642 places.
[2023-03-13 20:36:24] [INFO ] Transformed 20160 transitions.
[2023-03-13 20:36:24] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
FORMULA CANConstruction-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-01 FALSE 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-13 20:36:25] [INFO ] Computed 141 place invariants in 305 ms
[2023-03-13 20:36:29] [INFO ] [Real]Absence check using 71 positive place invariants in 212 ms returned sat
[2023-03-13 20:36:29] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 88 ms returned sat
[2023-03-13 20:36:30] [INFO ] After 4093ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2023-03-13 20:36:33] [INFO ] [Nat]Absence check using 71 positive place invariants in 231 ms returned sat
[2023-03-13 20:36:33] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 103 ms returned sat
[2023-03-13 20:36:55] [INFO ] After 18931ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-13 20:36:55] [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 20:36:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:36:55] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:13
FORMULA CANConstruction-PT-070-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-070-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 209 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 10642 transition count 19698
Reduce places removed 462 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 472 rules applied. Total rules applied 934 place count 10180 transition count 19688
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 944 place count 10170 transition count 19688
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 944 place count 10170 transition count 19684
Deduced a syphon composed of 4 places in 21 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 952 place count 10166 transition count 19684
Discarding 4672 places :
Symmetric choice reduction at 3 with 4672 rule applications. Total rules 5624 place count 5494 transition count 10340
Iterating global reduction 3 with 4672 rules applied. Total rules applied 10296 place count 5494 transition count 10340
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 10426 place count 5429 transition count 10275
Free-agglomeration rule applied 31 times.
Iterating global reduction 3 with 31 rules applied. Total rules applied 10457 place count 5429 transition count 10244
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 10488 place count 5398 transition count 10244
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 10494 place count 5398 transition count 10238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 10500 place count 5392 transition count 10238
Partial Free-agglomeration rule applied 110 times.
Drop transitions removed 110 transitions
Iterating global reduction 5 with 110 rules applied. Total rules applied 10610 place count 5392 transition count 10238
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 10612 place count 5392 transition count 10238
Applied a total of 10612 rules in 8026 ms. Remains 5392 /10642 variables (removed 5250) and now considering 10238/20160 (removed 9922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8028 ms. Remains : 5392/10642 places, 10238/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 12) seen :3
FORMULA CANConstruction-PT-070-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10238 rows 5392 cols
[2023-03-13 20:37:04] [INFO ] Computed 141 place invariants in 77 ms
[2023-03-13 20:37:05] [INFO ] [Real]Absence check using 71 positive place invariants in 110 ms returned sat
[2023-03-13 20:37:05] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2023-03-13 20:37:06] [INFO ] After 1689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 20:37:07] [INFO ] [Nat]Absence check using 71 positive place invariants in 117 ms returned sat
[2023-03-13 20:37:07] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 59 ms returned sat
[2023-03-13 20:37:15] [INFO ] After 6545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 20:37:15] [INFO ] State equation strengthened by 9843 read => feed constraints.
[2023-03-13 20:37:21] [INFO ] After 5974ms SMT Verify possible using 9843 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-13 20:37:28] [INFO ] After 13550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2369 ms.
[2023-03-13 20:37:31] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 112 ms.
Support contains 162 out of 5392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5392/5392 places, 10238/10238 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 5392 transition count 10237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5391 transition count 10237
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 5389 transition count 10233
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5389 transition count 10233
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 48 place count 5368 transition count 10212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 5367 transition count 10213
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 5367 transition count 10213
Applied a total of 51 rules in 4287 ms. Remains 5367 /5392 variables (removed 25) and now considering 10213/10238 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4287 ms. Remains : 5367/5392 places, 10213/10238 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 8) seen :2
FORMULA CANConstruction-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 26 ms. (steps per millisecond=384 ) 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 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 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10213 rows 5367 cols
[2023-03-13 20:37:35] [INFO ] Computed 141 place invariants in 60 ms
[2023-03-13 20:37:37] [INFO ] [Real]Absence check using 71 positive place invariants in 168 ms returned sat
[2023-03-13 20:37:37] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-13 20:37:37] [INFO ] After 1499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 20:37:38] [INFO ] [Nat]Absence check using 71 positive place invariants in 164 ms returned sat
[2023-03-13 20:37:38] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-13 20:37:44] [INFO ] After 5146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 20:37:44] [INFO ] State equation strengthened by 9868 read => feed constraints.
[2023-03-13 20:37:49] [INFO ] After 5066ms SMT Verify possible using 9868 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 20:37:55] [INFO ] After 10288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3274 ms.
[2023-03-13 20:37:58] [INFO ] After 20760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 108 ms.
Support contains 123 out of 5367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5367/5367 places, 10213/10213 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 5367 transition count 10212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5366 transition count 10212
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 38 place count 5348 transition count 10194
Applied a total of 38 rules in 1681 ms. Remains 5348 /5367 variables (removed 19) and now considering 10194/10213 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1681 ms. Remains : 5348/5367 places, 10194/10213 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-070-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10194 rows 5348 cols
[2023-03-13 20:38:00] [INFO ] Computed 141 place invariants in 66 ms
[2023-03-13 20:38:01] [INFO ] [Real]Absence check using 71 positive place invariants in 170 ms returned sat
[2023-03-13 20:38:01] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 60 ms returned sat
[2023-03-13 20:38:01] [INFO ] After 1323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 20:38:03] [INFO ] [Nat]Absence check using 71 positive place invariants in 172 ms returned sat
[2023-03-13 20:38:03] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2023-03-13 20:38:08] [INFO ] After 4950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 20:38:08] [INFO ] State equation strengthened by 9886 read => feed constraints.
[2023-03-13 20:38:13] [INFO ] After 4634ms SMT Verify possible using 9886 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 20:38:17] [INFO ] After 8748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2972 ms.
[2023-03-13 20:38:20] [INFO ] After 18559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANConstruction-PT-070-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 58 ms.
Support contains 65 out of 5348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5348/5348 places, 10194/10194 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 5348 transition count 10193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5347 transition count 10193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 5343 transition count 10185
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 5343 transition count 10185
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 44 place count 5326 transition count 10168
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 5322 transition count 10168
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 5322 transition count 10168
Applied a total of 53 rules in 4386 ms. Remains 5322 /5348 variables (removed 26) and now considering 10168/10194 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4386 ms. Remains : 5322/5348 places, 10168/10194 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 80632 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80632 steps, saw 61694 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10168 rows 5322 cols
[2023-03-13 20:38:28] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-13 20:38:29] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:38:29] [INFO ] [Nat]Absence check using 71 positive place invariants in 113 ms returned sat
[2023-03-13 20:38:29] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 95 ms returned sat
[2023-03-13 20:38:34] [INFO ] After 3989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:38:34] [INFO ] State equation strengthened by 9912 read => feed constraints.
[2023-03-13 20:38:37] [INFO ] After 2970ms SMT Verify possible using 9912 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:38:39] [INFO ] After 4911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1359 ms.
[2023-03-13 20:38:40] [INFO ] After 11506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 65 out of 5322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 10168/10168 transitions.
Applied a total of 0 rules in 994 ms. Remains 5322 /5322 variables (removed 0) and now considering 10168/10168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 995 ms. Remains : 5322/5322 places, 10168/10168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5322/5322 places, 10168/10168 transitions.
Applied a total of 0 rules in 917 ms. Remains 5322 /5322 variables (removed 0) and now considering 10168/10168 (removed 0) transitions.
[2023-03-13 20:38:42] [INFO ] Invariant cache hit.
[2023-03-13 20:38:45] [INFO ] Implicit Places using invariants in 3210 ms returned []
Implicit Place search using SMT only with invariants took 3217 ms to find 0 implicit places.
[2023-03-13 20:38:45] [INFO ] Invariant cache hit.
[2023-03-13 20:38:51] [INFO ] Dead Transitions using invariants and state equation in 5581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9718 ms. Remains : 5322/5322 places, 10168/10168 transitions.
Graph (trivial) has 9685 edges and 5322 vertex of which 4457 / 5322 are part of one of the 63 SCC in 6 ms
Free SCC test removed 4394 places
Drop transitions removed 8686 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 8708 transitions.
Graph (complete) has 1941 edges and 928 vertex of which 690 are kept as prefixes of interest. Removing 238 places using SCC suffix rule.1 ms
Discarding 238 places :
Also discarding 119 output transitions
Drop transitions removed 119 transitions
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Drop transitions removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 550 rules applied. Total rules applied 552 place count 690 transition count 791
Reduce places removed 412 places and 0 transitions.
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 896 rules applied. Total rules applied 1448 place count 277 transition count 308
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 1596 place count 197 transition count 240
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 1596 place count 197 transition count 226
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1624 place count 183 transition count 226
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1630 place count 177 transition count 220
Iterating global reduction 3 with 6 rules applied. Total rules applied 1636 place count 177 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 rules applied. Total rules applied 1641 place count 176 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1642 place count 175 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1642 place count 175 transition count 214
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1647 place count 172 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1648 place count 171 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 1649 place count 171 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1653 place count 169 transition count 211
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1655 place count 169 transition count 209
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 1656 place count 168 transition count 209
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1657 place count 167 transition count 208
Iterating global reduction 6 with 1 rules applied. Total rules applied 1658 place count 167 transition count 208
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 1671 place count 167 transition count 195
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1685 place count 154 transition count 194
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 1710 place count 154 transition count 194
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1735 place count 129 transition count 169
Iterating global reduction 7 with 25 rules applied. Total rules applied 1760 place count 129 transition count 169
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1772 place count 117 transition count 157
Applied a total of 1772 rules in 105 ms. Remains 117 /5322 variables (removed 5205) and now considering 157/10168 (removed 10011) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 157 rows 117 cols
[2023-03-13 20:38:51] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-13 20:38:51] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 20:38:51] [INFO ] [Nat]Absence check using 26 positive place invariants in 2 ms returned sat
[2023-03-13 20:38:51] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 20:38:51] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 20:38:51] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-13 20:38:51] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 20:38:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 20:38:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5322 places, 10168 transitions and 40628 arcs took 39 ms.
[2023-03-13 20:38:52] [INFO ] Flatten gal took : 472 ms
Total runtime 148436 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: 5322 NrTr: 10168 NrArc: 40628)

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

net check time: 0m 0.006sec

init dd package: 0m 2.977sec


before gc: list nodes free: 1632713

after gc: idd nodes used:27893283, unused:36106717; list nodes free:148316133

before gc: list nodes free: 124213

after gc: idd nodes used:55774058, unused:8225942; list nodes free:34388692

RS generation: 55m 5.884sec


-> last computed set: #nodes 55769111 (5.6e+07) #states 12,538,266,255,362 (13)


CANNOT_COMPUTE


BK_STOP 1678743293064

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

idd.cc:820: DD Exception: No free nodes

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

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