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-167813696100687.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100687
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678741399583

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:03:22] [INFO ] Load time of PNML (sax parser for PT used): 753 ms
[2023-03-13 21:03:22] [INFO ] Transformed 17282 places.
[2023-03-13 21:03:22] [INFO ] Transformed 33120 transitions.
[2023-03-13 21:03:22] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 974 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 16) seen :7
FORMULA CANConstruction-PT-090-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-00 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 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 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 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 33120 rows 17282 cols
[2023-03-13 21:03:24] [INFO ] Computed 181 place invariants in 464 ms
[2023-03-13 21:03:29] [INFO ] [Real]Absence check using 91 positive place invariants in 468 ms returned sat
[2023-03-13 21:03:30] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 210 ms returned sat
[2023-03-13 21:03:49] [INFO ] After 18550ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-13 21:03:49] [INFO ] State equation strengthened by 16110 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:339)
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:03:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:03:49] [INFO ] After 25442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 214 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 17282 transition count 32678
Reduce places removed 442 places and 0 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 1 with 532 rules applied. Total rules applied 974 place count 16840 transition count 32588
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 1064 place count 16750 transition count 32588
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1064 place count 16750 transition count 32546
Deduced a syphon composed of 42 places in 24 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1148 place count 16708 transition count 32546
Discarding 7844 places :
Symmetric choice reduction at 3 with 7844 rule applications. Total rules 8992 place count 8864 transition count 16858
Iterating global reduction 3 with 7844 rules applied. Total rules applied 16836 place count 8864 transition count 16858
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 9 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 16932 place count 8816 transition count 16810
Free-agglomeration rule applied 88 times.
Iterating global reduction 3 with 88 rules applied. Total rules applied 17020 place count 8816 transition count 16722
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 17108 place count 8728 transition count 16722
Partial Free-agglomeration rule applied 134 times.
Drop transitions removed 134 transitions
Iterating global reduction 4 with 134 rules applied. Total rules applied 17242 place count 8728 transition count 16722
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 17262 place count 8728 transition count 16722
Applied a total of 17262 rules in 17941 ms. Remains 8728 /17282 variables (removed 8554) and now considering 16722/33120 (removed 16398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17944 ms. Remains : 8728/17282 places, 16722/33120 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
FORMULA CANConstruction-PT-090-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 16722 rows 8728 cols
[2023-03-13 21:04:08] [INFO ] Computed 181 place invariants in 191 ms
[2023-03-13 21:04:11] [INFO ] [Real]Absence check using 91 positive place invariants in 275 ms returned sat
[2023-03-13 21:04:11] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 130 ms returned sat
[2023-03-13 21:04:12] [INFO ] After 3398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 21:04:14] [INFO ] [Nat]Absence check using 91 positive place invariants in 267 ms returned sat
[2023-03-13 21:04:14] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2023-03-13 21:04:29] [INFO ] After 13636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 21:04:30] [INFO ] State equation strengthened by 16244 read => feed constraints.
[2023-03-13 21:04:37] [INFO ] After 7271ms SMT Verify possible using 16244 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 21:04:37] [INFO ] After 7273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 21:04:37] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANConstruction-PT-090-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 190 ms.
Support contains 86 out of 8728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8728/8728 places, 16722/16722 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 8728 transition count 16689
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 8695 transition count 16689
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 80 place count 8681 transition count 16661
Iterating global reduction 2 with 14 rules applied. Total rules applied 94 place count 8681 transition count 16661
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 182 place count 8637 transition count 16617
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 204 place count 8626 transition count 16620
Applied a total of 204 rules in 10950 ms. Remains 8626 /8728 variables (removed 102) and now considering 16620/16722 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10950 ms. Remains : 8626/8728 places, 16620/16722 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
FORMULA CANConstruction-PT-090-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16620 rows 8626 cols
[2023-03-13 21:04:49] [INFO ] Computed 181 place invariants in 184 ms
[2023-03-13 21:04:50] [INFO ] [Real]Absence check using 91 positive place invariants in 245 ms returned sat
[2023-03-13 21:04:50] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 109 ms returned sat
[2023-03-13 21:04:51] [INFO ] After 1932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:04:52] [INFO ] [Nat]Absence check using 91 positive place invariants in 237 ms returned sat
[2023-03-13 21:04:53] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 110 ms returned sat
[2023-03-13 21:05:06] [INFO ] After 12760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 21:05:06] [INFO ] State equation strengthened by 16289 read => feed constraints.
[2023-03-13 21:05:14] [INFO ] After 8508ms SMT Verify possible using 16289 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 21:05:38] [INFO ] Deduced a trap composed of 3 places in 22452 ms of which 23 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 21:05:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:05:38] [INFO ] After 47495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA CANConstruction-PT-090-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 50 ms.
Support contains 83 out of 8626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8626/8626 places, 16620/16620 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8626 transition count 16619
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8625 transition count 16619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8624 transition count 16618
Applied a total of 4 rules in 5682 ms. Remains 8624 /8626 variables (removed 2) and now considering 16618/16620 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5682 ms. Remains : 8624/8626 places, 16618/16620 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 207576 steps, run timeout after 3008 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207576 steps, saw 204440 distinct states, run finished after 3023 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16618 rows 8624 cols
[2023-03-13 21:05:48] [INFO ] Computed 181 place invariants in 174 ms
[2023-03-13 21:05:50] [INFO ] [Real]Absence check using 91 positive place invariants in 273 ms returned sat
[2023-03-13 21:05:50] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 118 ms returned sat
[2023-03-13 21:05:50] [INFO ] After 2202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:05:51] [INFO ] [Nat]Absence check using 91 positive place invariants in 262 ms returned sat
[2023-03-13 21:05:51] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 136 ms returned sat
[2023-03-13 21:06:03] [INFO ] After 10759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:06:03] [INFO ] State equation strengthened by 16290 read => feed constraints.
[2023-03-13 21:06:10] [INFO ] After 7299ms SMT Verify possible using 16290 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:06:14] [INFO ] After 11312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 828 ms.
[2023-03-13 21:06:15] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 83 out of 8624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8624/8624 places, 16618/16618 transitions.
Applied a total of 0 rules in 2804 ms. Remains 8624 /8624 variables (removed 0) and now considering 16618/16618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2808 ms. Remains : 8624/8624 places, 16618/16618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8624/8624 places, 16618/16618 transitions.
Applied a total of 0 rules in 2632 ms. Remains 8624 /8624 variables (removed 0) and now considering 16618/16618 (removed 0) transitions.
[2023-03-13 21:06:20] [INFO ] Invariant cache hit.
[2023-03-13 21:06:21] [INFO ] Implicit Places using invariants in 818 ms returned []
Implicit Place search using SMT only with invariants took 835 ms to find 0 implicit places.
[2023-03-13 21:06:21] [INFO ] Invariant cache hit.
[2023-03-13 21:06:31] [INFO ] Dead Transitions using invariants and state equation in 9893 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13367 ms. Remains : 8624/8624 places, 16618/16618 transitions.
Graph (trivial) has 14627 edges and 8624 vertex of which 6637 / 8624 are part of one of the 73 SCC in 17 ms
Free SCC test removed 6564 places
Drop transitions removed 13031 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 13045 transitions.
Graph (complete) has 4160 edges and 2060 vertex of which 1849 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.2 ms
Discarding 211 places :
Also discarding 83 output transitions
Drop transitions removed 83 transitions
Ensure Unique test removed 10 places
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Performed 1509 Post agglomeration using F-continuation condition.Transition count delta: 1509
Iterating post reduction 0 with 1597 rules applied. Total rules applied 1599 place count 1839 transition count 1903
Reduce places removed 1509 places and 0 transitions.
Ensure Unique test removed 1477 transitions
Reduce isomorphic transitions removed 1477 transitions.
Iterating post reduction 1 with 2986 rules applied. Total rules applied 4585 place count 330 transition count 426
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 4585 place count 330 transition count 412
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 4613 place count 316 transition count 412
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 4677 place count 252 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 4741 place count 252 transition count 347
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4745 place count 252 transition count 343
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 3 with 4 rules applied. Total rules applied 4749 place count 250 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4751 place count 249 transition count 342
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 4757 place count 249 transition count 336
Free-agglomeration rule applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 4774 place count 249 transition count 319
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 4800 place count 229 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 4803 place count 226 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 4806 place count 226 transition count 310
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 4852 place count 226 transition count 310
Applied a total of 4852 rules in 341 ms. Remains 226 /8624 variables (removed 8398) and now considering 310/16618 (removed 16308) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 310 rows 226 cols
[2023-03-13 21:06:32] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-13 21:06:32] [INFO ] [Real]Absence check using 29 positive place invariants in 3 ms returned sat
[2023-03-13 21:06:32] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 21:06:32] [INFO ] [Nat]Absence check using 29 positive place invariants in 2 ms returned sat
[2023-03-13 21:06:32] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 21:06:32] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-13 21:06:32] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 21:06:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 21:06:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8624 places, 16618 transitions and 66358 arcs took 74 ms.
[2023-03-13 21:06:33] [INFO ] Flatten gal took : 625 ms
Total runtime 191754 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: gen
(NrP: 8624 NrTr: 16618 NrArc: 66358)

parse formulas
formulas created successfully
place and transition orderings generation:0m16.758sec

net check time: 0m 0.025sec

init dd package: 0m 3.023sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6768452 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16076004 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.441sec

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CANConstruction-PT-090, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696100687"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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