About the Execution of Marcie+red for ShieldRVs-PT-100A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9761.936 | 3600000.00 | 3670026.00 | 729.30 | ?F?????????????? | 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.r426-tajo-167905978600162.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 ShieldRVs-PT-100A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Feb 26 19:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 19:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 19:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 19:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 652K Mar 5 18:23 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 ShieldRVs-PT-100A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-100A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679345296804
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:48:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:48:18] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-20 20:48:18] [INFO ] Transformed 1403 places.
[2023-03-20 20:48:18] [INFO ] Transformed 1903 transitions.
[2023-03-20 20:48:18] [INFO ] Found NUPN structural information;
[2023-03-20 20:48:18] [INFO ] Parsed PT model containing 1403 places and 1903 transitions and 9200 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 209 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 162 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-20 20:48:18] [INFO ] Computed 401 place invariants in 36 ms
[2023-03-20 20:48:19] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-20 20:48:19] [INFO ] Invariant cache hit.
[2023-03-20 20:48:21] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
[2023-03-20 20:48:21] [INFO ] Invariant cache hit.
[2023-03-20 20:48:22] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3557 ms. Remains : 1403/1403 places, 1903/1903 transitions.
Support contains 209 out of 1403 places after structural reductions.
[2023-03-20 20:48:22] [INFO ] Flatten gal took : 247 ms
[2023-03-20 20:48:22] [INFO ] Flatten gal took : 127 ms
[2023-03-20 20:48:23] [INFO ] Input system was already deterministic with 1903 transitions.
Support contains 204 out of 1403 places (down from 209) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 583 ms. (steps per millisecond=17 ) properties (out of 76) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-20 20:48:25] [INFO ] Invariant cache hit.
[2023-03-20 20:48:25] [INFO ] [Real]Absence check using 401 positive place invariants in 57 ms returned sat
[2023-03-20 20:48:27] [INFO ] After 2324ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-20 20:48:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 75 ms returned sat
[2023-03-20 20:48:31] [INFO ] After 2715ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-20 20:48:32] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 6 ms to minimize.
[2023-03-20 20:48:33] [INFO ] Deduced a trap composed of 7 places in 456 ms of which 2 ms to minimize.
[2023-03-20 20:48:33] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 2 ms to minimize.
[2023-03-20 20:48:34] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 2 ms to minimize.
[2023-03-20 20:48:34] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 1 ms to minimize.
[2023-03-20 20:48:35] [INFO ] Deduced a trap composed of 19 places in 442 ms of which 1 ms to minimize.
[2023-03-20 20:48:35] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 1 ms to minimize.
[2023-03-20 20:48:36] [INFO ] Deduced a trap composed of 8 places in 425 ms of which 1 ms to minimize.
[2023-03-20 20:48:36] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 1 ms to minimize.
[2023-03-20 20:48:37] [INFO ] Deduced a trap composed of 13 places in 431 ms of which 1 ms to minimize.
[2023-03-20 20:48:37] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 1 ms to minimize.
[2023-03-20 20:48:38] [INFO ] Deduced a trap composed of 17 places in 407 ms of which 1 ms to minimize.
[2023-03-20 20:48:38] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 1 ms to minimize.
[2023-03-20 20:48:38] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 1 ms to minimize.
[2023-03-20 20:48:39] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 1 ms to minimize.
[2023-03-20 20:48:39] [INFO ] Deduced a trap composed of 8 places in 431 ms of which 1 ms to minimize.
[2023-03-20 20:48:40] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 1 ms to minimize.
[2023-03-20 20:48:41] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 1 ms to minimize.
[2023-03-20 20:48:41] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 1 ms to minimize.
[2023-03-20 20:48:42] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 1 ms to minimize.
[2023-03-20 20:48:42] [INFO ] Deduced a trap composed of 9 places in 444 ms of which 1 ms to minimize.
[2023-03-20 20:48:43] [INFO ] Deduced a trap composed of 13 places in 434 ms of which 1 ms to minimize.
[2023-03-20 20:48:43] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 1 ms to minimize.
[2023-03-20 20:48:44] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 1 ms to minimize.
[2023-03-20 20:48:44] [INFO ] Deduced a trap composed of 8 places in 402 ms of which 1 ms to minimize.
[2023-03-20 20:48:45] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 1 ms to minimize.
[2023-03-20 20:48:45] [INFO ] Deduced a trap composed of 8 places in 416 ms of which 1 ms to minimize.
[2023-03-20 20:48:46] [INFO ] Deduced a trap composed of 8 places in 405 ms of which 1 ms to minimize.
[2023-03-20 20:48:46] [INFO ] Deduced a trap composed of 12 places in 432 ms of which 0 ms to minimize.
[2023-03-20 20:48:47] [INFO ] Deduced a trap composed of 11 places in 413 ms of which 1 ms to minimize.
[2023-03-20 20:48:47] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 0 ms to minimize.
[2023-03-20 20:48:48] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 1 ms to minimize.
[2023-03-20 20:48:48] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 0 ms to minimize.
[2023-03-20 20:48:49] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 5 ms to minimize.
[2023-03-20 20:48:49] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 1 ms to minimize.
[2023-03-20 20:48:50] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 1 ms to minimize.
[2023-03-20 20:48:50] [INFO ] Deduced a trap composed of 15 places in 404 ms of which 1 ms to minimize.
[2023-03-20 20:48:51] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 1 ms to minimize.
[2023-03-20 20:48:51] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 1 ms to minimize.
[2023-03-20 20:48:52] [INFO ] Deduced a trap composed of 8 places in 405 ms of which 2 ms to minimize.
[2023-03-20 20:48:52] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-20 20:48:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:48:52] [INFO ] After 25307ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1318 ms.
Support contains 32 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 0 with 196 rules applied. Total rules applied 198 place count 1402 transition count 1902
Applied a total of 198 rules in 730 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 1402/1403 places, 1902/1903 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 20:48:55] [INFO ] Computed 401 place invariants in 17 ms
[2023-03-20 20:48:56] [INFO ] [Real]Absence check using 401 positive place invariants in 108 ms returned sat
[2023-03-20 20:48:57] [INFO ] After 2206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 20:48:58] [INFO ] [Nat]Absence check using 401 positive place invariants in 70 ms returned sat
[2023-03-20 20:49:00] [INFO ] After 1813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 20:49:01] [INFO ] Deduced a trap composed of 7 places in 492 ms of which 1 ms to minimize.
[2023-03-20 20:49:01] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2023-03-20 20:49:02] [INFO ] Deduced a trap composed of 7 places in 470 ms of which 1 ms to minimize.
[2023-03-20 20:49:03] [INFO ] Deduced a trap composed of 14 places in 522 ms of which 0 ms to minimize.
[2023-03-20 20:49:03] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 1 ms to minimize.
[2023-03-20 20:49:04] [INFO ] Deduced a trap composed of 7 places in 498 ms of which 1 ms to minimize.
[2023-03-20 20:49:04] [INFO ] Deduced a trap composed of 9 places in 497 ms of which 1 ms to minimize.
[2023-03-20 20:49:05] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 0 ms to minimize.
[2023-03-20 20:49:06] [INFO ] Deduced a trap composed of 7 places in 475 ms of which 1 ms to minimize.
[2023-03-20 20:49:07] [INFO ] Deduced a trap composed of 7 places in 531 ms of which 1 ms to minimize.
[2023-03-20 20:49:07] [INFO ] Deduced a trap composed of 7 places in 518 ms of which 1 ms to minimize.
[2023-03-20 20:49:08] [INFO ] Deduced a trap composed of 12 places in 495 ms of which 1 ms to minimize.
[2023-03-20 20:49:08] [INFO ] Deduced a trap composed of 7 places in 523 ms of which 1 ms to minimize.
[2023-03-20 20:49:09] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 1 ms to minimize.
[2023-03-20 20:49:10] [INFO ] Deduced a trap composed of 15 places in 559 ms of which 1 ms to minimize.
[2023-03-20 20:49:10] [INFO ] Deduced a trap composed of 7 places in 536 ms of which 1 ms to minimize.
[2023-03-20 20:49:11] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 1 ms to minimize.
[2023-03-20 20:49:12] [INFO ] Deduced a trap composed of 7 places in 515 ms of which 1 ms to minimize.
[2023-03-20 20:49:12] [INFO ] Deduced a trap composed of 7 places in 503 ms of which 0 ms to minimize.
[2023-03-20 20:49:13] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 1 ms to minimize.
[2023-03-20 20:49:14] [INFO ] Deduced a trap composed of 7 places in 527 ms of which 1 ms to minimize.
[2023-03-20 20:49:14] [INFO ] Deduced a trap composed of 11 places in 513 ms of which 1 ms to minimize.
[2023-03-20 20:49:15] [INFO ] Deduced a trap composed of 7 places in 468 ms of which 1 ms to minimize.
[2023-03-20 20:49:16] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 1 ms to minimize.
[2023-03-20 20:49:16] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 1 ms to minimize.
[2023-03-20 20:49:17] [INFO ] Deduced a trap composed of 11 places in 498 ms of which 2 ms to minimize.
[2023-03-20 20:49:17] [INFO ] Deduced a trap composed of 16 places in 476 ms of which 2 ms to minimize.
[2023-03-20 20:49:18] [INFO ] Deduced a trap composed of 7 places in 479 ms of which 1 ms to minimize.
[2023-03-20 20:49:19] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 1 ms to minimize.
[2023-03-20 20:49:19] [INFO ] Deduced a trap composed of 12 places in 510 ms of which 1 ms to minimize.
[2023-03-20 20:49:20] [INFO ] Deduced a trap composed of 11 places in 491 ms of which 1 ms to minimize.
[2023-03-20 20:49:20] [INFO ] Deduced a trap composed of 16 places in 473 ms of which 1 ms to minimize.
[2023-03-20 20:49:21] [INFO ] Deduced a trap composed of 7 places in 466 ms of which 1 ms to minimize.
[2023-03-20 20:49:22] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 1 ms to minimize.
[2023-03-20 20:49:22] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 1 ms to minimize.
[2023-03-20 20:49:23] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-20 20:49:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:49:23] [INFO ] After 25347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 814 ms.
Support contains 23 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 149 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 20:49:25] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-20 20:49:25] [INFO ] [Real]Absence check using 401 positive place invariants in 76 ms returned sat
[2023-03-20 20:49:26] [INFO ] After 1714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:49:27] [INFO ] [Nat]Absence check using 401 positive place invariants in 110 ms returned sat
[2023-03-20 20:49:30] [INFO ] After 2738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:49:30] [INFO ] Deduced a trap composed of 7 places in 465 ms of which 0 ms to minimize.
[2023-03-20 20:49:31] [INFO ] Deduced a trap composed of 7 places in 453 ms of which 1 ms to minimize.
[2023-03-20 20:49:31] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 1 ms to minimize.
[2023-03-20 20:49:32] [INFO ] Deduced a trap composed of 7 places in 441 ms of which 1 ms to minimize.
[2023-03-20 20:49:32] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 1 ms to minimize.
[2023-03-20 20:49:33] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 1 ms to minimize.
[2023-03-20 20:49:33] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 0 ms to minimize.
[2023-03-20 20:49:34] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 0 ms to minimize.
[2023-03-20 20:49:34] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 1 ms to minimize.
[2023-03-20 20:49:35] [INFO ] Deduced a trap composed of 7 places in 701 ms of which 2 ms to minimize.
[2023-03-20 20:49:35] [INFO ] Deduced a trap composed of 7 places in 459 ms of which 1 ms to minimize.
[2023-03-20 20:49:36] [INFO ] Deduced a trap composed of 7 places in 416 ms of which 1 ms to minimize.
[2023-03-20 20:49:36] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-20 20:49:37] [INFO ] Deduced a trap composed of 7 places in 400 ms of which 1 ms to minimize.
[2023-03-20 20:49:43] [INFO ] Deduced a trap composed of 7 places in 5732 ms of which 1 ms to minimize.
[2023-03-20 20:49:43] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 1 ms to minimize.
[2023-03-20 20:49:44] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 1 ms to minimize.
[2023-03-20 20:49:44] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2023-03-20 20:49:45] [INFO ] Deduced a trap composed of 7 places in 404 ms of which 1 ms to minimize.
[2023-03-20 20:49:45] [INFO ] Deduced a trap composed of 11 places in 601 ms of which 1 ms to minimize.
[2023-03-20 20:49:46] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 1 ms to minimize.
[2023-03-20 20:49:46] [INFO ] Deduced a trap composed of 7 places in 406 ms of which 0 ms to minimize.
[2023-03-20 20:49:47] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 0 ms to minimize.
[2023-03-20 20:49:47] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 1 ms to minimize.
[2023-03-20 20:49:48] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 1 ms to minimize.
[2023-03-20 20:49:48] [INFO ] Deduced a trap composed of 15 places in 412 ms of which 1 ms to minimize.
[2023-03-20 20:49:49] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 0 ms to minimize.
[2023-03-20 20:49:49] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-20 20:49:49] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:49:50] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:49:50] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:49:50] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2023-03-20 20:49:50] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:49:51] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:49:51] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-20 20:49:51] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:49:52] [INFO ] Deduced a trap composed of 3 places in 935 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-20 20:49:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:49:52] [INFO ] After 25976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 216 ms.
Support contains 16 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 138 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 20:49:53] [INFO ] Computed 401 place invariants in 18 ms
[2023-03-20 20:49:53] [INFO ] [Real]Absence check using 401 positive place invariants in 63 ms returned sat
[2023-03-20 20:49:54] [INFO ] After 1193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:49:55] [INFO ] [Nat]Absence check using 401 positive place invariants in 59 ms returned sat
[2023-03-20 20:49:57] [INFO ] After 1916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:49:57] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2023-03-20 20:49:58] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2023-03-20 20:49:58] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2023-03-20 20:49:58] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 0 ms to minimize.
[2023-03-20 20:49:59] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 1 ms to minimize.
[2023-03-20 20:49:59] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 0 ms to minimize.
[2023-03-20 20:50:00] [INFO ] Deduced a trap composed of 7 places in 383 ms of which 1 ms to minimize.
[2023-03-20 20:50:00] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 1 ms to minimize.
[2023-03-20 20:50:01] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 1 ms to minimize.
[2023-03-20 20:50:01] [INFO ] Deduced a trap composed of 7 places in 416 ms of which 1 ms to minimize.
[2023-03-20 20:50:02] [INFO ] Deduced a trap composed of 7 places in 426 ms of which 1 ms to minimize.
[2023-03-20 20:50:02] [INFO ] Deduced a trap composed of 7 places in 379 ms of which 0 ms to minimize.
[2023-03-20 20:50:03] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-20 20:50:03] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 1 ms to minimize.
[2023-03-20 20:50:04] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 1 ms to minimize.
[2023-03-20 20:50:04] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2023-03-20 20:50:05] [INFO ] Deduced a trap composed of 12 places in 403 ms of which 1 ms to minimize.
[2023-03-20 20:50:05] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-20 20:50:06] [INFO ] Deduced a trap composed of 11 places in 390 ms of which 1 ms to minimize.
[2023-03-20 20:50:06] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2023-03-20 20:50:06] [INFO ] Deduced a trap composed of 7 places in 412 ms of which 1 ms to minimize.
[2023-03-20 20:50:07] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2023-03-20 20:50:07] [INFO ] Deduced a trap composed of 7 places in 368 ms of which 1 ms to minimize.
[2023-03-20 20:50:08] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2023-03-20 20:50:08] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 1 ms to minimize.
[2023-03-20 20:50:09] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 1 ms to minimize.
[2023-03-20 20:50:09] [INFO ] Deduced a trap composed of 7 places in 362 ms of which 2 ms to minimize.
[2023-03-20 20:50:10] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 3 ms to minimize.
[2023-03-20 20:50:10] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 1 ms to minimize.
[2023-03-20 20:50:10] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2023-03-20 20:50:11] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 1 ms to minimize.
[2023-03-20 20:50:11] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-20 20:50:12] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 0 ms to minimize.
[2023-03-20 20:50:12] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-20 20:50:12] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2023-03-20 20:50:13] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 2 ms to minimize.
[2023-03-20 20:50:13] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-20 20:50:14] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2023-03-20 20:50:14] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-20 20:50:14] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 2 ms to minimize.
[2023-03-20 20:50:15] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-20 20:50:15] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 1 ms to minimize.
[2023-03-20 20:50:16] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 0 ms to minimize.
[2023-03-20 20:50:16] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
[2023-03-20 20:50:16] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-20 20:50:16] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 0 ms to minimize.
[2023-03-20 20:50:17] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-20 20:50:17] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:50:17] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:50:18] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:50:18] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-20 20:50:18] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 0 ms to minimize.
[2023-03-20 20:50:18] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:50:19] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-20 20:50:19] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:50:19] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-20 20:50:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:50:19] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 144 ms.
Support contains 13 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1902/1902 transitions.
Applied a total of 0 rules in 137 ms. Remains 1402 /1402 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1402/1402 places, 1902/1902 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-20 20:50:20] [INFO ] Flatten gal took : 269 ms
[2023-03-20 20:50:20] [INFO ] Flatten gal took : 252 ms
[2023-03-20 20:50:21] [INFO ] Input system was already deterministic with 1903 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 50 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:21] [INFO ] Flatten gal took : 98 ms
[2023-03-20 20:50:21] [INFO ] Flatten gal took : 105 ms
[2023-03-20 20:50:21] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 108 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 1402/1403 places, 1902/1903 transitions.
[2023-03-20 20:50:21] [INFO ] Flatten gal took : 62 ms
[2023-03-20 20:50:21] [INFO ] Flatten gal took : 70 ms
[2023-03-20 20:50:21] [INFO ] Input system was already deterministic with 1902 transitions.
Finished random walk after 5177 steps, including 3 resets, run visited all 1 properties in 38 ms. (steps per millisecond=136 )
FORMULA ShieldRVs-PT-100A-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 87 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 1401/1403 places, 1901/1903 transitions.
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 53 ms
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:50:22] [INFO ] Input system was already deterministic with 1901 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 81 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 1401/1403 places, 1901/1903 transitions.
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 50 ms
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 70 ms
[2023-03-20 20:50:22] [INFO ] Input system was already deterministic with 1901 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 75 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 1402/1403 places, 1902/1903 transitions.
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:50:22] [INFO ] Flatten gal took : 64 ms
[2023-03-20 20:50:23] [INFO ] Input system was already deterministic with 1902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 28 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:23] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:50:23] [INFO ] Flatten gal took : 88 ms
[2023-03-20 20:50:23] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1401 transition count 1901
Applied a total of 2 rules in 101 ms. Remains 1401 /1403 variables (removed 2) and now considering 1901/1903 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 1401/1403 places, 1901/1903 transitions.
[2023-03-20 20:50:23] [INFO ] Flatten gal took : 68 ms
[2023-03-20 20:50:23] [INFO ] Flatten gal took : 86 ms
[2023-03-20 20:50:23] [INFO ] Input system was already deterministic with 1901 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:23] [INFO ] Flatten gal took : 95 ms
[2023-03-20 20:50:24] [INFO ] Flatten gal took : 78 ms
[2023-03-20 20:50:24] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 65 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:24] [INFO ] Flatten gal took : 100 ms
[2023-03-20 20:50:24] [INFO ] Flatten gal took : 85 ms
[2023-03-20 20:50:24] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 59 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:24] [INFO ] Flatten gal took : 88 ms
[2023-03-20 20:50:24] [INFO ] Flatten gal took : 97 ms
[2023-03-20 20:50:25] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 29 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 57 ms
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:50:25] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 29 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 57 ms
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:50:25] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 39 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 56 ms
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:50:25] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 27 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 56 ms
[2023-03-20 20:50:25] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:50:26] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Applied a total of 0 rules in 28 ms. Remains 1403 /1403 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1403/1403 places, 1903/1903 transitions.
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 57 ms
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 59 ms
[2023-03-20 20:50:26] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1403/1403 places, 1903/1903 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1402 transition count 1902
Applied a total of 2 rules in 94 ms. Remains 1402 /1403 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 1402/1403 places, 1902/1903 transitions.
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 63 ms
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 67 ms
[2023-03-20 20:50:26] [INFO ] Input system was already deterministic with 1902 transitions.
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:50:26] [INFO ] Flatten gal took : 58 ms
[2023-03-20 20:50:26] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 20:50:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1403 places, 1903 transitions and 9200 arcs took 9 ms.
Total runtime 128523 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1403 NrTr: 1903 NrArc: 9200)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.223sec
net check time: 0m 0.001sec
init dd package: 0m 2.976sec
before gc: list nodes free: 289517
after gc: idd nodes used:4817, unused:63995183; list nodes free:274699365
before gc: list nodes free: 1958311
after gc: idd nodes used:5275, unused:63994725; list nodes free:276794011
before gc: list nodes free: 1779745
after gc: idd nodes used:5056, unused:63994944; list nodes free:276795202
before gc: list nodes free: 1895527
after gc: idd nodes used:5343, unused:63994657; list nodes free:276793639
before gc: list nodes free: 1800513
after gc: idd nodes used:5522, unused:63994478; list nodes free:276792900
before gc: list nodes free: 1911987
after gc: idd nodes used:5610, unused:63994390; list nodes free:276792543
before gc: list nodes free: 1928298
after gc: idd nodes used:5524, unused:63994476; list nodes free:276792949
before gc: list nodes free: 1587874
after gc: idd nodes used:5644, unused:63994356; list nodes free:276792292
before gc: list nodes free: 1889431
after gc: idd nodes used:5676, unused:63994324; list nodes free:276792028
before gc: list nodes free: 1761259
after gc: idd nodes used:5885, unused:63994115; list nodes free:276791057
before gc: list nodes free: 1491593
after gc: idd nodes used:5919, unused:63994081; list nodes free:276790869
before gc: list nodes free: 1689240
after gc: idd nodes used:5913, unused:63994087; list nodes free:276790853
before gc: list nodes free: 1510908
after gc: idd nodes used:5972, unused:63994028; list nodes free:276790755
before gc: list nodes free: 1692028
after gc: idd nodes used:5940, unused:63994060; list nodes free:276790827
before gc: list nodes free: 1853517
after gc: idd nodes used:5684, unused:63994316; list nodes free:276792104
before gc: list nodes free: 1684016
after gc: idd nodes used:5748, unused:63994252; list nodes free:276791615
before gc: list nodes free: 1931917
after gc: idd nodes used:6048, unused:63993952; list nodes free:276790191
before gc: list nodes free: 1854211
after gc: idd nodes used:5895, unused:63994105; list nodes free:276791022
before gc: list nodes free: 1677818
after gc: idd nodes used:5793, unused:63994207; list nodes free:276791452
before gc: list nodes free: 1784191
after gc: idd nodes used:6067, unused:63993933; list nodes free:276789968
before gc: list nodes free: 1768657
after gc: idd nodes used:5970, unused:63994030; list nodes free:276790659
before gc: list nodes free: 1422819
after gc: idd nodes used:6264, unused:63993736; list nodes free:276789069
before gc: list nodes free: 1156766
after gc: idd nodes used:6144, unused:63993856; list nodes free:276789614
before gc: list nodes free: 1542784
after gc: idd nodes used:6044, unused:63993956; list nodes free:276790117
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6381736 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16094592 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.014sec
4504 4620 4818 5186 5042 4909 5136 5299 5322 4972 5250 5279 5225 5414 5454 5523 5598 5749 5585 5611 5754 5497 5548 5433 5512 5699 5621 5632 5663 5717 5658 5696 5919 5892 5950 5726 5825 5868 5717 5833 5885 6223 6109 5989 6039 6012 6014 6006 5781 5744 5682 5920 5841 5764 5763 5843 5867 5915 5930 5863 5899 5899 5914 5902 5756 5851 5849 5904 5917 5974 6079 5987 6005 6210 6222 6046 6158 6134 5918 6081 6068 6296 6162
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="ShieldRVs-PT-100A"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-100A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978600162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100A.tgz
mv ShieldRVs-PT-100A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;