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

About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d2m020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16220.600 3600000.00 1404884.00 1905368.20 FTTTFTFF?F??TT?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r329-tall-167889202600899.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is RingSingleMessageInMbox-PT-d2m020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202600899
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 102M
-rw-r--r-- 1 mcc users 8.9K Feb 26 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 05:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 05:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 102M 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 RingSingleMessageInMbox-PT-d2m020-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d2m020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679191916288

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d2m020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 02:11:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 02:11:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:12:00] [INFO ] Load time of PNML (sax parser for PT used): 3117 ms
[2023-03-19 02:12:01] [INFO ] Transformed 66950 places.
[2023-03-19 02:12:04] [INFO ] Transformed 213625 transitions.
[2023-03-19 02:12:08] [INFO ] Parsed PT model containing 66950 places and 213625 transitions and 854500 arcs in 10862 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 36863 places in 324 ms
Reduce places removed 36863 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 30087 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30087/30087 places, 213625/213625 transitions.
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 30052 transition count 213325
Discarding 308 places :
Symmetric choice reduction at 1 with 308 rule applications. Total rules 643 place count 29744 transition count 44681
Iterating global reduction 1 with 308 rules applied. Total rules applied 951 place count 29744 transition count 44681
Applied a total of 951 rules in 3855 ms. Remains 29744 /30087 variables (removed 343) and now considering 44681/213625 (removed 168944) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 02:12:27] [INFO ] Computed 3 place invariants in 13565 ms
[2023-03-19 02:12:30] [INFO ] Implicit Places using invariants in 16745 ms returned []
Implicit Place search using SMT only with invariants took 16775 ms to find 0 implicit places.
[2023-03-19 02:12:30] [INFO ] Invariant cache hit.
[2023-03-19 02:12:33] [INFO ] Dead Transitions using invariants and state equation in 2615 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29744/30087 places, 44681/213625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23260 ms. Remains : 29744/30087 places, 44681/213625 transitions.
Support contains 12 out of 29744 places after structural reductions.
[2023-03-19 02:12:35] [INFO ] Flatten gal took : 1456 ms
[2023-03-19 02:12:36] [INFO ] Flatten gal took : 1266 ms
[2023-03-19 02:12:39] [INFO ] Input system was already deterministic with 44681 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 2918 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 02:12:42] [INFO ] Invariant cache hit.
[2023-03-19 02:12:48] [INFO ] After 6426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 02:12:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 104 ms returned sat
[2023-03-19 02:12:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 02:13:13] [INFO ] After 16824ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-19 02:32:53] [INFO ] State equation strengthened by 14909 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.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-19 02:32:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 02:32:54] [INFO ] After 1205404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7181 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 9848 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9853 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.294 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(!p0))))'
Support contains 2 out of 29744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 12917 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 02:33:17] [INFO ] Invariant cache hit.
[2023-03-19 02:33:20] [INFO ] Implicit Places using invariants in 2993 ms returned []
Implicit Place search using SMT only with invariants took 2995 ms to find 0 implicit places.
[2023-03-19 02:33:20] [INFO ] Invariant cache hit.
[2023-03-19 02:33:24] [INFO ] Dead Transitions using invariants and state equation in 3199 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19116 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d2m020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s24727 s24772)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 23 ms.
FORMULA RingSingleMessageInMbox-PT-d2m020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d2m020-LTLCardinality-00 finished in 19622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 801 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 02:33:25] [INFO ] Invariant cache hit.
[2023-03-19 02:33:27] [INFO ] Implicit Places using invariants in 2544 ms returned []
Implicit Place search using SMT only with invariants took 2546 ms to find 0 implicit places.
[2023-03-19 02:33:27] [INFO ] Invariant cache hit.
[2023-03-19 02:33:30] [INFO ] Dead Transitions using invariants and state equation in 2698 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6057 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d2m020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 3 s15825)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 37240 steps with 5376 reset in 10002 ms.
Product exploration timeout after 38190 steps with 5575 reset in 10002 ms.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.130 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 2886 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 32169 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 32169 steps, saw 20880 distinct states, run finished after 6003 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 02:34:00] [INFO ] Invariant cache hit.
[2023-03-19 02:34:05] [INFO ] [Real]Absence check using 2 positive place invariants in 107 ms returned sat
[2023-03-19 02:34:05] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-19 02:34:25] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.77 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 1166 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1168 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1485 resets, run finished after 2700 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33227 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 33227 steps, saw 20962 distinct states, run finished after 6001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-19 02:34:50] [INFO ] Computed 4 place invariants in 14710 ms
[2023-03-19 02:34:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 332 ms returned sat
[2023-03-19 02:35:15] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 488 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 417 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-19 02:35:16] [INFO ] Invariant cache hit.
[2023-03-19 02:35:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 02:35:18] [INFO ] Implicit Places using invariants in 2373 ms returned []
Implicit Place search using SMT only with invariants took 2375 ms to find 0 implicit places.
[2023-03-19 02:35:18] [INFO ] Invariant cache hit.
[2023-03-19 02:35:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 02:35:21] [INFO ] Dead Transitions using invariants and state equation in 2803 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5607 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 29713 transition count 44575
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 111 place count 29677 transition count 44545
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 111 place count 29677 transition count 44417
Deduced a syphon composed of 128 places in 19 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 367 place count 29549 transition count 44417
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 14 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 441 place count 29512 transition count 44380
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 591 place count 29512 transition count 44230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 15 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 603 place count 29506 transition count 44224
Free-agglomeration rule applied 14399 times.
Iterating global reduction 3 with 14399 rules applied. Total rules applied 15002 place count 29506 transition count 29825
Reduce places removed 14399 places and 0 transitions.
Iterating post reduction 3 with 14399 rules applied. Total rules applied 29401 place count 15107 transition count 29825
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 29406 place count 15107 transition count 29825
Applied a total of 29406 rules in 14334 ms. Remains 15107 /29713 variables (removed 14606) and now considering 29825/44620 (removed 14795) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29825 rows 15107 cols
[2023-03-19 02:35:57] [INFO ] Computed 5 place invariants in 20511 ms
[2023-03-19 02:35:59] [INFO ] [Real]Absence check using 4 positive place invariants in 146 ms returned sat
[2023-03-19 02:35:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-19 02:40:31] [INFO ] After 273735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 362 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 1295 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 02:40:50] [INFO ] Computed 3 place invariants in 17337 ms
[2023-03-19 02:40:53] [INFO ] Implicit Places using invariants in 19691 ms returned []
Implicit Place search using SMT only with invariants took 19695 ms to find 0 implicit places.
[2023-03-19 02:40:53] [INFO ] Invariant cache hit.
[2023-03-19 02:40:55] [INFO ] Dead Transitions using invariants and state equation in 2289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23298 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.275 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 5096 ms. (steps per millisecond=1 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62926 steps, run timeout after 15001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 62926 steps, saw 38542 distinct states, run finished after 15002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 02:41:16] [INFO ] Invariant cache hit.
[2023-03-19 02:41:20] [INFO ] [Real]Absence check using 2 positive place invariants in 101 ms returned sat
[2023-03-19 02:41:20] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-19 02:41:41] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Graph (complete) has 104082 edges and 29744 vertex of which 29718 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.85 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 29718 transition count 44625
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 29718 transition count 44620
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 29713 transition count 44620
Applied a total of 67 rules in 1199 ms. Remains 29713 /29744 variables (removed 31) and now considering 44620/44681 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1200 ms. Remains : 29713/29744 places, 44620/44681 transitions.
Incomplete random walk after 10000 steps, including 1505 resets, run finished after 2868 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39263 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 39263 steps, saw 26734 distinct states, run finished after 6001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44620 rows 29713 cols
[2023-03-19 02:42:09] [INFO ] Computed 4 place invariants in 18366 ms
[2023-03-19 02:42:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 341 ms returned sat
[2023-03-19 02:42:34] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 29713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 423 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29713/29713 places, 44620/44620 transitions.
Applied a total of 0 rules in 431 ms. Remains 29713 /29713 variables (removed 0) and now considering 44620/44620 (removed 0) transitions.
[2023-03-19 02:42:35] [INFO ] Invariant cache hit.
[2023-03-19 02:42:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 02:42:40] [INFO ] Implicit Places using invariants in 4331 ms returned []
Implicit Place search using SMT only with invariants took 4342 ms to find 0 implicit places.
[2023-03-19 02:42:40] [INFO ] Invariant cache hit.
[2023-03-19 02:42:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-19 02:42:42] [INFO ] Dead Transitions using invariants and state equation in 2370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7157 ms. Remains : 29713/29713 places, 44620/44620 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1323 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 606 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Product exploration timeout after 42150 steps with 6126 reset in 10001 ms.
Product exploration timeout after 41000 steps with 5959 reset in 10002 ms.
Support contains 1 out of 29744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 439 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
// Phase 1: matrix 44681 rows 29744 cols
[2023-03-19 02:43:17] [INFO ] Computed 3 place invariants in 12435 ms
[2023-03-19 02:43:20] [INFO ] Implicit Places using invariants in 15180 ms returned []
Implicit Place search using SMT only with invariants took 15187 ms to find 0 implicit places.
[2023-03-19 02:43:20] [INFO ] Invariant cache hit.
[2023-03-19 02:43:22] [INFO ] Dead Transitions using invariants and state equation in 2216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17865 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Treatment of property RingSingleMessageInMbox-PT-d2m020-LTLCardinality-08 finished in 601711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(G(p1)))))'
Support contains 4 out of 29744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29744/29744 places, 44681/44681 transitions.
Applied a total of 0 rules in 87 ms. Remains 29744 /29744 variables (removed 0) and now considering 44681/44681 (removed 0) transitions.
[2023-03-19 02:43:26] [INFO ] Invariant cache hit.
[2023-03-19 02:43:28] [INFO ] Implicit Places using invariants in 2303 ms returned []
Implicit Place search using SMT only with invariants took 2326 ms to find 0 implicit places.
[2023-03-19 02:43:28] [INFO ] Invariant cache hit.
[2023-03-19 02:43:30] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4670 ms. Remains : 29744/29744 places, 44681/44681 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d2m020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s8267 s12933), p1:(LEQ s4981 s18323)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 41050 steps with 5875 reset in 10002 ms.
Product exploration timeout after 42320 steps with 6247 reset in 10004 ms.
Computed a total of 14474 stabilizing places and 21817 stable transitions
Graph (complete) has 104366 edges and 29744 vertex of which 29743 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.121 ms
Computed a total of 14474 stabilizing places and 21817 stable transitions
Detected a total of 14474/29744 stabilizing places and 21817/44681 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 2790 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Probabilistic random walk after 38493 steps, saw 26344 distinct states, run finished after 6003 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 02:44:00] [INFO ] Invariant cache hit.
[2023-03-19 02:44:05] [INFO ] After 4351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 02:44:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 94 ms returned sat
[2023-03-19 02:44:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 02:44:30] [INFO ] After 19966ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 139392 kB
After kill :
MemTotal: 16393232 kB
MemFree: 142192 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 LTLCardinality -timeout 360 -rebuildPNML

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="RingSingleMessageInMbox-PT-d2m020"
export BK_EXAMINATION="LTLCardinality"
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 RingSingleMessageInMbox-PT-d2m020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889202600899"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d2m020.tgz
mv RingSingleMessageInMbox-PT-d2m020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;