fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813696200783
Last Updated
May 14, 2023

About the Execution of Marcie+red for CANInsertWithFailure-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9597.048 3600000.00 3696380.00 885.70 FF??TTTTFF????TT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 00:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 60M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678751824668

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=CANInsertWithFailure-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 23:57:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 23:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:57:07] [INFO ] Load time of PNML (sax parser for PT used): 1228 ms
[2023-03-13 23:57:07] [INFO ] Transformed 21204 places.
[2023-03-13 23:57:08] [INFO ] Transformed 60600 transitions.
[2023-03-13 23:57:08] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1569 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1022 ms. (steps per millisecond=9 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) 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 31 ms. (steps per millisecond=322 ) 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 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 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) 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 14) 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 14) 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 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 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 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 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 60600 rows 21204 cols
[2023-03-13 23:57:32] [INFO ] Computed 103 place invariants in 22101 ms
[2023-03-13 23:57:40] [INFO ] [Real]Absence check using 101 positive place invariants in 316 ms returned sat
[2023-03-13 23:57:40] [INFO ] [Real]Absence check using 101 positive and 2 generalized place invariants in 522 ms returned sat
[2023-03-13 23:57:43] [INFO ] After 11111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-13 23:57:50] [INFO ] [Nat]Absence check using 101 positive place invariants in 301 ms returned sat
[2023-03-13 23:57:50] [INFO ] [Nat]Absence check using 101 positive and 2 generalized place invariants in 628 ms returned sat
[2023-03-13 23:58:08] [INFO ] After 13345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 23:58:08] [INFO ] State equation strengthened by 19900 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:58:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:58:08] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 143 out of 21204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Graph (complete) has 81501 edges and 21204 vertex of which 21203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.66 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 654 transitions
Trivial Post-agglo rules discarded 654 transitions
Performed 654 trivial Post agglomeration. Transition count delta: 654
Iterating post reduction 0 with 654 rules applied. Total rules applied 655 place count 21203 transition count 59946
Reduce places removed 654 places and 0 transitions.
Iterating post reduction 1 with 654 rules applied. Total rules applied 1309 place count 20549 transition count 59946
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1309 place count 20549 transition count 59932
Deduced a syphon composed of 14 places in 33 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1337 place count 20535 transition count 59932
Performed 9829 Post agglomeration using F-continuation condition.Transition count delta: 9829
Deduced a syphon composed of 9829 places in 61 ms
Reduce places removed 9829 places and 0 transitions.
Iterating global reduction 2 with 19658 rules applied. Total rules applied 20995 place count 10706 transition count 50103
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 2 with 32 rules applied. Total rules applied 21027 place count 10706 transition count 50071
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 21059 place count 10674 transition count 50071
Partial Free-agglomeration rule applied 10074 times.
Drop transitions removed 10074 transitions
Iterating global reduction 3 with 10074 rules applied. Total rules applied 31133 place count 10674 transition count 50071
Partial Free-agglomeration rule applied 1397 times.
Drop transitions removed 1397 transitions
Iterating global reduction 3 with 1397 rules applied. Total rules applied 32530 place count 10674 transition count 50071
Applied a total of 32530 rules in 34721 ms. Remains 10674 /21204 variables (removed 10530) and now considering 50071/60600 (removed 10529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34731 ms. Remains : 10674/21204 places, 50071/60600 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 14) seen :3
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-13 23:58:44] [INFO ] Flow matrix only has 50030 transitions (discarded 41 similar events)
// Phase 1: matrix 50030 rows 10674 cols
[2023-03-13 23:58:54] [INFO ] Computed 102 place invariants in 9721 ms
[2023-03-13 23:58:57] [INFO ] [Real]Absence check using 100 positive place invariants in 178 ms returned sat
[2023-03-13 23:58:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 252 ms returned sat
[2023-03-13 23:58:59] [INFO ] After 4834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 23:59:02] [INFO ] [Nat]Absence check using 100 positive place invariants in 160 ms returned sat
[2023-03-13 23:59:02] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 230 ms returned sat
[2023-03-13 23:59:24] [INFO ] After 19649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 23:59:24] [INFO ] State equation strengthened by 49403 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:59:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 23:59:24] [INFO ] After 25657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 139 out of 10674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10674/10674 places, 50071/50071 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10672 transition count 50069
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 10672 transition count 50069
Applied a total of 6 rules in 14333 ms. Remains 10672 /10674 variables (removed 2) and now considering 50069/50071 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14333 ms. Remains : 10672/10674 places, 50069/50071 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Interrupted probabilistic random walk after 84205 steps, run timeout after 3002 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84205 steps, saw 82408 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-13 23:59:43] [INFO ] Flow matrix only has 50030 transitions (discarded 39 similar events)
// Phase 1: matrix 50030 rows 10672 cols
[2023-03-13 23:59:54] [INFO ] Computed 102 place invariants in 11254 ms
[2023-03-13 23:59:57] [INFO ] [Real]Absence check using 100 positive place invariants in 131 ms returned sat
[2023-03-13 23:59:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-14 00:00:19] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 00:00:22] [INFO ] [Nat]Absence check using 100 positive place invariants in 150 ms returned sat
[2023-03-14 00:00:22] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-14 00:00:44] [INFO ] After 19943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 00:00:44] [INFO ] State equation strengthened by 49411 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-14 00:00:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 00:00:45] [INFO ] After 25482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 138 out of 10672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10672/10672 places, 50069/50069 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10671 transition count 50068
Applied a total of 2 rules in 10433 ms. Remains 10671 /10672 variables (removed 1) and now considering 50068/50069 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10434 ms. Remains : 10671/10672 places, 50068/50069 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 912 ms. (steps per millisecond=10 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 28 ms. (steps per millisecond=357 ) 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 38 ms. (steps per millisecond=263 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-14 00:00:56] [INFO ] Flow matrix only has 50029 transitions (discarded 39 similar events)
// Phase 1: matrix 50029 rows 10671 cols
[2023-03-14 00:01:05] [INFO ] Computed 102 place invariants in 8987 ms
[2023-03-14 00:01:08] [INFO ] [Real]Absence check using 100 positive place invariants in 139 ms returned sat
[2023-03-14 00:01:08] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 228 ms returned sat
[2023-03-14 00:01:09] [INFO ] After 3694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 00:01:12] [INFO ] [Nat]Absence check using 100 positive place invariants in 162 ms returned sat
[2023-03-14 00:01:12] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-14 00:01:34] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 118 out of 10671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10671/10671 places, 50068/50068 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 13 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 10662 transition count 50059
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 10662 transition count 50059
Applied a total of 23 rules in 15269 ms. Remains 10662 /10671 variables (removed 9) and now considering 50059/50068 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15269 ms. Remains : 10662/10671 places, 50059/50068 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 972 ms. (steps per millisecond=10 ) properties (out of 9) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-08 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-14 00:01:50] [INFO ] Flow matrix only has 50025 transitions (discarded 34 similar events)
// Phase 1: matrix 50025 rows 10662 cols
[2023-03-14 00:02:00] [INFO ] Computed 102 place invariants in 9613 ms
[2023-03-14 00:02:03] [INFO ] [Real]Absence check using 100 positive place invariants in 178 ms returned sat
[2023-03-14 00:02:03] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 229 ms returned sat
[2023-03-14 00:02:04] [INFO ] After 3568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 00:02:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 148 ms returned sat
[2023-03-14 00:02:07] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 227 ms returned sat
[2023-03-14 00:02:29] [INFO ] After 20626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 00:02:30] [INFO ] State equation strengthened by 49435 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-14 00:02:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 00:02:30] [INFO ] After 25838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 105 out of 10662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10662/10662 places, 50059/50059 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 10654 transition count 50051
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 10654 transition count 50051
Applied a total of 19 rules in 16392 ms. Remains 10654 /10662 variables (removed 8) and now considering 50051/50059 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16392 ms. Remains : 10654/10662 places, 50051/50059 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 8) seen :2
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 00:02:47] [INFO ] Flow matrix only has 50020 transitions (discarded 31 similar events)
// Phase 1: matrix 50020 rows 10654 cols
[2023-03-14 00:02:55] [INFO ] Computed 102 place invariants in 7974 ms
[2023-03-14 00:02:57] [INFO ] [Real]Absence check using 100 positive place invariants in 155 ms returned sat
[2023-03-14 00:02:57] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 242 ms returned sat
[2023-03-14 00:02:58] [INFO ] After 2926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 00:03:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 145 ms returned sat
[2023-03-14 00:03:00] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 242 ms returned sat
[2023-03-14 00:03:23] [INFO ] After 21282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 00:03:23] [INFO ] State equation strengthened by 49455 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-14 00:03:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 00:03:23] [INFO ] After 25553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 103 out of 10654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10654/10654 places, 50051/50051 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10653 transition count 50050
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 10653 transition count 50050
Applied a total of 3 rules in 14802 ms. Remains 10653 /10654 variables (removed 1) and now considering 50050/50051 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14803 ms. Remains : 10653/10654 places, 50050/50051 transitions.
[2023-03-14 00:03:38] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 00:03:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10653 places, 50050 transitions and 200077 arcs took 174 ms.
[2023-03-14 00:03:40] [INFO ] Flatten gal took : 1414 ms
Total runtime 394121 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: 10653 NrTr: 50050 NrArc: 200077)

parse formulas
formulas created successfully
place and transition orderings generation:1m38.772sec

net check time: 0m 0.034sec

init dd package: 0m 3.004sec


before gc: list nodes free: 1666669

after gc: idd nodes used:1197521, unused:62802479; list nodes free:253021254
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6448300 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15998160 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 6.833sec

287457 1311920

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-100"
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 CANInsertWithFailure-PT-100, 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-167813696200783"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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