Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900484.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 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 CSRepetitions-COL-02-00
FORMULA_NAME CSRepetitions-COL-02-01
FORMULA_NAME CSRepetitions-COL-02-02
FORMULA_NAME CSRepetitions-COL-02-03
FORMULA_NAME CSRepetitions-COL-02-04
FORMULA_NAME CSRepetitions-COL-02-05
FORMULA_NAME CSRepetitions-COL-02-06
FORMULA_NAME CSRepetitions-COL-02-07
FORMULA_NAME CSRepetitions-COL-02-08
FORMULA_NAME CSRepetitions-COL-02-09
FORMULA_NAME CSRepetitions-COL-02-10
FORMULA_NAME CSRepetitions-COL-02-11
FORMULA_NAME CSRepetitions-COL-02-12
FORMULA_NAME CSRepetitions-COL-02-13
FORMULA_NAME CSRepetitions-COL-02-14
FORMULA_NAME CSRepetitions-COL-02-15

=== Now, execution of the tool begins

BK_START 1620548959051

Running Version 0
[2021-05-09 08:29:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 08:29:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:29:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-09 08:29:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-09 08:29:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 489 ms
[2021-05-09 08:29:21] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA CSRepetitions-COL-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:29:21] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions in 9 ms.
[2021-05-09 08:29:21] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14908920656228236378.dot
[2021-05-09 08:29:21] [INFO ] Initial state test concluded for 4 properties.
FORMULA CSRepetitions-COL-02-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 4665 resets, run finished after 89 ms. (steps per millisecond=1123 ) properties (out of 18) seen :15
Running SMT prover for 3 properties.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 08:29:21] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 08:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-09 08:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-09 08:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
[2021-05-09 08:29:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 08:29:21] [INFO ] Flatten gal took : 14 ms
FORMULA CSRepetitions-COL-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 08:29:21] [INFO ] Flatten gal took : 2 ms
[2021-05-09 08:29:21] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 1 ms.
[2021-05-09 08:29:21] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_399586682389640291.dot
[2021-05-09 08:29:21] [INFO ] Initial state test concluded for 1 properties.
Support contains 19 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:21] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 08:29:21] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:21] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 08:29:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
[2021-05-09 08:29:21] [INFO ] Flatten gal took : 4 ms
[2021-05-09 08:29:21] [INFO ] Flatten gal took : 4 ms
[2021-05-09 08:29:21] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 100000 steps, including 5619 resets, run finished after 197 ms. (steps per millisecond=507 ) properties (out of 16) seen :13
Running SMT prover for 3 properties.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-09 08:29:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2021-05-09 08:29:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-09 08:29:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 16 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-09 08:29:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-02-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 2 (ADD s11 s12 s13 s14)), p1:(LEQ (ADD s15 s16 s17 s18 s19 s20 s21 s22) (ADD s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-02-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-02 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (X(G(p0))||(p1&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 08:29:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-COL-02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4) (ADD s9 s10)), p1:(LEQ (ADD s11 s12 s13 s14) (ADD s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-02-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-03 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(F((p0||(p1 U (p2||G(p1))))))||(F((p0||(p1 U (p2||G(p1)))))&&X(G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1 s2 s3 s4) (ADD s11 s12 s13 s14)), p2:(AND (LEQ (ADD s1 s2 s3 s4) (ADD s11 s12 s13 s14)) (GT (ADD s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19 s20 s21 s22))), p1:(GT (ADD s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 16 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2021-05-09 08:29:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:24] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:24] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
[2021-05-09 08:29:24] [INFO ] Flatten gal took : 4 ms
[2021-05-09 08:29:24] [INFO ] Flatten gal took : 4 ms
[2021-05-09 08:29:24] [INFO ] Time to serialize gal into /tmp/LTL6613588088389927320.gal : 9 ms
[2021-05-09 08:29:24] [INFO ] Time to serialize properties into /tmp/LTL5884910758955693525.ltl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6613588088389927320.gal, -t, CGAL, -LTL, /tmp/LTL5884910758955693525.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6613588088389927320.gal -t CGAL -LTL /tmp/LTL5884910758955693525.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F(("((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))")||(("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))")U(("(((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))&&((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7)))")||(G("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))")))))))||((F(("((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))")||(("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))")U(("(((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))&&((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7)))")||(G("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))"))))))&&(X(G("((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)>(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))"))))))))
Formula 0 simplified : !XF(GF("((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))" | ("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))" U ("(((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))&&((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7)))" | G"((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))"))) | (F("((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))" | ("((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))" U ("(((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)<=(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))&&((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7)))" | G"((((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3)>(((((((Server_Anwering_0+Server_Anwering_1)+Server_Anwering_2)+Server_Anwering_3)+Server_Anwering_4)+Server_Anwering_5)+Server_Anwering_6)+Server_Anwering_7))"))) & XG"((((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3)>(((Client_Waiting_0+Client_Waiting_1)+Client_Waiting_2)+Client_Waiting_3))"))
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.115695,20620,1,0,86,16329,89,36,980,17394,81
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-COL-02-05 finished in 2145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:24] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s9 s10) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-06 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(G(p0)) U p1))))], workingDir=/home/mcc/execution]
Support contains 14 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-09 08:29:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:25] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s9 s10)), p0:(LEQ (ADD s1 s2 s3 s4) (ADD s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5591 reset in 281 ms.
Stack based approach found an accepted trace after 3276 steps with 185 reset with depth 20 and stack size 20 in 8 ms.
FORMULA CSRepetitions-COL-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-07 finished in 529 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-09 08:29:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:25] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:25] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-09 08:29:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2021-05-09 08:29:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:26] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Product exploration explored 100000 steps with 33333 reset in 170 ms.
[2021-05-09 08:29:27] [INFO ] Flatten gal took : 3 ms
[2021-05-09 08:29:27] [INFO ] Flatten gal took : 3 ms
[2021-05-09 08:29:27] [INFO ] Time to serialize gal into /tmp/LTL17530388408721751774.gal : 1 ms
[2021-05-09 08:29:27] [INFO ] Time to serialize properties into /tmp/LTL2934753349071202651.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17530388408721751774.gal, -t, CGAL, -LTL, /tmp/LTL2934753349071202651.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17530388408721751774.gal -t CGAL -LTL /tmp/LTL2934753349071202651.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(RequestBufferSlots_0<=(((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3))"))))
Formula 0 simplified : !XF"(RequestBufferSlots_0<=(((Client_Sending_0+Client_Sending_1)+Client_Sending_2)+Client_Sending_3))"
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/12/16/28
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.080925,18200,1,0,87,13833,82,36,813,13341,76
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CSRepetitions-COL-02-08 finished in 1659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:27] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2021-05-09 08:29:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-11 automaton TGBA [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:(LEQ 1 (ADD s11 s12 s13 s14))], 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]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-11 finished in 418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 08:29:27] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-09 08:29:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2021-05-09 08:29:27] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 08:29:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s15 s16 s17 s18 s19 s20 s21 s22) (ADD s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-12 finished in 156 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620548968302

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CSRepetitions-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-02, 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 r026-tajo-162038143900484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;