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.r041-tajo-167813695200782.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 ltsminxred
Input is CANInsertWithFailure-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695200782
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678667709093

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 00:35:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:35:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:35:11] [INFO ] Load time of PNML (sax parser for PT used): 1167 ms
[2023-03-13 00:35:12] [INFO ] Transformed 21204 places.
[2023-03-13 00:35:12] [INFO ] Transformed 60600 transitions.
[2023-03-13 00:35:12] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 952 ms. (steps per millisecond=10 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-00 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 60600 rows 21204 cols
[2023-03-13 00:35:33] [INFO ] Computed 103 place invariants in 19590 ms
[2023-03-13 00:35:40] [INFO ] [Real]Absence check using 101 positive place invariants in 337 ms returned sat
[2023-03-13 00:35:41] [INFO ] [Real]Absence check using 101 positive and 2 generalized place invariants in 524 ms returned sat
[2023-03-13 00:35:42] [INFO ] After 8292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 00:35:48] [INFO ] [Nat]Absence check using 101 positive place invariants in 242 ms returned sat
[2023-03-13 00:35:49] [INFO ] [Nat]Absence check using 101 positive and 2 generalized place invariants in 481 ms returned sat
[2023-03-13 00:36:07] [INFO ] After 13849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:36:07] [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 00:36:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:36:07] [INFO ] After 25306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 192 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.59 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 678 transitions
Trivial Post-agglo rules discarded 678 transitions
Performed 678 trivial Post agglomeration. Transition count delta: 678
Iterating post reduction 0 with 678 rules applied. Total rules applied 679 place count 21203 transition count 59922
Reduce places removed 678 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 685 rules applied. Total rules applied 1364 place count 20525 transition count 59915
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1371 place count 20518 transition count 59915
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1371 place count 20518 transition count 59913
Deduced a syphon composed of 2 places in 29 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1375 place count 20516 transition count 59913
Performed 9424 Post agglomeration using F-continuation condition.Transition count delta: 9424
Deduced a syphon composed of 9424 places in 87 ms
Reduce places removed 9424 places and 0 transitions.
Iterating global reduction 3 with 18848 rules applied. Total rules applied 20223 place count 11092 transition count 50489
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 20230 place count 11092 transition count 50482
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 20237 place count 11085 transition count 50482
Partial Free-agglomeration rule applied 10683 times.
Drop transitions removed 10683 transitions
Iterating global reduction 4 with 10683 rules applied. Total rules applied 30920 place count 11085 transition count 50482
Partial Free-agglomeration rule applied 308 times.
Drop transitions removed 308 transitions
Iterating global reduction 4 with 308 rules applied. Total rules applied 31228 place count 11085 transition count 50482
Applied a total of 31228 rules in 31970 ms. Remains 11085 /21204 variables (removed 10119) and now considering 50482/60600 (removed 10118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31979 ms. Remains : 11085/21204 places, 50482/60600 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 13) seen :2
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) 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 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
Running SMT prover for 11 properties.
[2023-03-13 00:36:40] [INFO ] Flow matrix only has 50391 transitions (discarded 91 similar events)
// Phase 1: matrix 50391 rows 11085 cols
[2023-03-13 00:36:49] [INFO ] Computed 102 place invariants in 8869 ms
[2023-03-13 00:36:53] [INFO ] [Real]Absence check using 100 positive place invariants in 142 ms returned sat
[2023-03-13 00:36:53] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-13 00:36:53] [INFO ] After 3916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 00:36:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 168 ms returned sat
[2023-03-13 00:36:56] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 266 ms returned sat
[2023-03-13 00:37:18] [INFO ] After 19336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-13 00:37:19] [INFO ] State equation strengthened by 48637 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 00:37:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:37:19] [INFO ] After 25553ms 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 0 ms.
Support contains 189 out of 11085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11085/11085 places, 50482/50482 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11084 transition count 50481
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 11084 transition count 50481
Applied a total of 4 rules in 12730 ms. Remains 11084 /11085 variables (removed 1) and now considering 50481/50482 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12731 ms. Remains : 11084/11085 places, 50481/50482 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 29 ms. (steps per millisecond=344 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) 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 10) 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 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
Interrupted probabilistic random walk after 67163 steps, run timeout after 3003 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67163 steps, saw 65556 distinct states, run finished after 3010 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-13 00:37:35] [INFO ] Flow matrix only has 50391 transitions (discarded 90 similar events)
// Phase 1: matrix 50391 rows 11084 cols
[2023-03-13 00:37:45] [INFO ] Computed 102 place invariants in 9907 ms
[2023-03-13 00:37:48] [INFO ] [Real]Absence check using 100 positive place invariants in 94 ms returned sat
[2023-03-13 00:37:48] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 190 ms returned sat
[2023-03-13 00:37:48] [INFO ] After 2500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 00:37:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 152 ms returned sat
[2023-03-13 00:37:51] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 250 ms returned sat
[2023-03-13 00:38:13] [INFO ] After 20171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 00:38:14] [INFO ] State equation strengthened by 48642 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 00:38:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:38:14] [INFO ] After 25661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 145 out of 11084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11084/11084 places, 50481/50481 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11084 transition count 50480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11083 transition count 50480
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 48 place count 11060 transition count 50457
Partial Free-agglomeration rule applied 410 times.
Drop transitions removed 410 transitions
Iterating global reduction 2 with 410 rules applied. Total rules applied 458 place count 11060 transition count 50457
Applied a total of 458 rules in 13247 ms. Remains 11060 /11084 variables (removed 24) and now considering 50457/50481 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13248 ms. Remains : 11060/11084 places, 50457/50481 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 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 40 ms. (steps per millisecond=250 ) 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 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-13 00:38:28] [INFO ] Flow matrix only has 50384 transitions (discarded 73 similar events)
// Phase 1: matrix 50384 rows 11060 cols
[2023-03-13 00:38:37] [INFO ] Computed 102 place invariants in 9362 ms
[2023-03-13 00:38:40] [INFO ] [Real]Absence check using 100 positive place invariants in 159 ms returned sat
[2023-03-13 00:38:41] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 244 ms returned sat
[2023-03-13 00:38:41] [INFO ] After 3599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 00:38:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 169 ms returned sat
[2023-03-13 00:38:44] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 259 ms returned sat
[2023-03-13 00:39:06] [INFO ] After 20045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 00:39:06] [INFO ] State equation strengthened by 49116 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 00:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:39:06] [INFO ] After 25587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 119 out of 11060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11060/11060 places, 50457/50457 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 10 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 11050 transition count 50447
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 133 place count 11050 transition count 50447
Applied a total of 133 rules in 13078 ms. Remains 11050 /11060 variables (removed 10) and now considering 50447/50457 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13078 ms. Remains : 11050/11060 places, 50447/50457 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 9) 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 9) 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 9) 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 9) 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 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 33 ms. (steps per millisecond=303 ) 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 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 80541 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80541 steps, saw 78430 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-13 00:39:24] [INFO ] Flow matrix only has 50388 transitions (discarded 59 similar events)
// Phase 1: matrix 50388 rows 11050 cols
[2023-03-13 00:39:33] [INFO ] Computed 102 place invariants in 9394 ms
[2023-03-13 00:39:36] [INFO ] [Real]Absence check using 100 positive place invariants in 134 ms returned sat
[2023-03-13 00:39:37] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-13 00:39:37] [INFO ] After 3562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 00:39:40] [INFO ] [Nat]Absence check using 100 positive place invariants in 154 ms returned sat
[2023-03-13 00:39:40] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 261 ms returned sat
[2023-03-13 00:40:02] [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 119 out of 11050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11050/11050 places, 50447/50447 transitions.
Applied a total of 0 rules in 4337 ms. Remains 11050 /11050 variables (removed 0) and now considering 50447/50447 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4338 ms. Remains : 11050/11050 places, 50447/50447 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11050/11050 places, 50447/50447 transitions.
Applied a total of 0 rules in 4396 ms. Remains 11050 /11050 variables (removed 0) and now considering 50447/50447 (removed 0) transitions.
[2023-03-13 00:40:11] [INFO ] Flow matrix only has 50388 transitions (discarded 59 similar events)
[2023-03-13 00:40:11] [INFO ] Invariant cache hit.
[2023-03-13 00:40:12] [INFO ] Implicit Places using invariants in 888 ms returned []
Implicit Place search using SMT only with invariants took 890 ms to find 0 implicit places.
[2023-03-13 00:40:12] [INFO ] Flow matrix only has 50388 transitions (discarded 59 similar events)
[2023-03-13 00:40:12] [INFO ] Invariant cache hit.
[2023-03-13 00:40:13] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6323 ms. Remains : 11050/11050 places, 50447/50447 transitions.
Graph (trivial) has 48641 edges and 11050 vertex of which 10220 / 11050 are part of one of the 2 SCC in 23 ms
Free SCC test removed 10218 places
Drop transitions removed 38084 transitions
Ensure Unique test removed 10021 transitions
Reduce isomorphic transitions removed 48105 transitions.
Graph (complete) has 2953 edges and 832 vertex of which 538 are kept as prefixes of interest. Removing 294 places using SCC suffix rule.1 ms
Discarding 294 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Drop transitions removed 581 transitions
Reduce isomorphic transitions removed 581 transitions.
Iterating post reduction 0 with 581 rules applied. Total rules applied 583 place count 538 transition count 1666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 583 place count 538 transition count 1664
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 587 place count 536 transition count 1664
Discarding 373 places :
Symmetric choice reduction at 1 with 373 rule applications. Total rules 960 place count 163 transition count 733
Iterating global reduction 1 with 373 rules applied. Total rules applied 1333 place count 163 transition count 733
Ensure Unique test removed 279 transitions
Reduce isomorphic transitions removed 279 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 1612 place count 163 transition count 454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1616 place count 161 transition count 452
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 2 with 4 rules applied. Total rules applied 1620 place count 159 transition count 450
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1623 place count 159 transition count 447
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 1630 place count 159 transition count 440
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1640 place count 159 transition count 430
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1662 place count 149 transition count 418
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1664 place count 149 transition count 416
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 1676 place count 149 transition count 416
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1681 place count 149 transition count 411
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1684 place count 146 transition count 405
Iterating global reduction 5 with 3 rules applied. Total rules applied 1687 place count 146 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1689 place count 146 transition count 403
Applied a total of 1689 rules in 540 ms. Remains 146 /11050 variables (removed 10904) and now considering 403/50447 (removed 50044) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 403 rows 146 cols
[2023-03-13 00:40:13] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-13 00:40:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 00:40:13] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 00:40:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 00:40:14] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 00:40:14] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-13 00:40:14] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-13 00:40:14] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-13 00:40:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11050 places, 50447 transitions and 201327 arcs took 269 ms.
[2023-03-13 00:40:17] [INFO ] Flatten gal took : 1711 ms
Total runtime 306280 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/536/inv_0_ --invariant=/tmp/536/inv_1_ --invariant=/tmp/536/inv_2_ --invariant=/tmp/536/inv_3_ --invariant=/tmp/536/inv_4_ --invariant=/tmp/536/inv_5_ --invariant=/tmp/536/inv_6_ --invariant=/tmp/536/inv_7_ --invariant=/tmp/536/inv_8_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6661032 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15996624 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANInsertWithFailure-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695200782"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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