Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016400211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.7K Apr 29 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 11:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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 Philosophers-COL-000100-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652803216256

Running Version 202205111006
[2022-05-17 16:00:17] [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]
[2022-05-17 16:00:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:00:17] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 16:00:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:00:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2022-05-17 16:00:18] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 16:00:18] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2022-05-17 16:00:18] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10097 steps, including 98 resets, run finished after 75 ms. (steps per millisecond=134 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:00:18] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-17 16:00:18] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 16:00:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:00:18] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Philosophers-COL-000100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 16:00:18] [INFO ] Flatten gal took : 13 ms
[2022-05-17 16:00:18] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:00:18] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 17 ms.
[2022-05-17 16:00:18] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:18] [INFO ] Computed 200 place invariants in 10 ms
[2022-05-17 16:00:18] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:18] [INFO ] Computed 200 place invariants in 23 ms
[2022-05-17 16:00:19] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:19] [INFO ] Computed 200 place invariants in 10 ms
[2022-05-17 16:00:19] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2022-05-17 16:00:19] [INFO ] Flatten gal took : 45 ms
[2022-05-17 16:00:19] [INFO ] Flatten gal took : 38 ms
[2022-05-17 16:00:19] [INFO ] Input system was already deterministic with 500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:19] [INFO ] Computed 200 place invariants in 11 ms
[2022-05-17 16:00:20] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2022-05-17 16:00:20] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:00:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-05-17 16:00:20] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:00:20] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-05-17 16:00:20] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 8 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X(p1)||p0) U X(p1))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 25 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:21] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:21] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:21] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:21] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:21] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:21] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 449 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (LEQ 3 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2597 ms.
Product exploration explored 100000 steps with 33333 reset in 2571 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLCardinality-04 finished in 7210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p0)||p1)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:28] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:28] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:28] [INFO ] Computed 200 place invariants in 9 ms
[2022-05-17 16:00:28] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:28] [INFO ] Computed 200 place invariants in 6 ms
[2022-05-17 16:00:28] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1447 ms.
Product exploration explored 100000 steps with 50000 reset in 1535 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000100-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLCardinality-05 finished in 4178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:32] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:32] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:32] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-17 16:00:32] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:32] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:33] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 15349 steps with 0 reset in 117 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-06 finished in 1006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))&&X(p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:33] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:00:33] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:33] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:33] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:33] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:34] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-07 finished in 989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!(p0 U X((G(p1) U p1)))))&&p2)))'
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:34] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:34] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:34] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-17 16:00:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:34] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:34] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, false, false, p1]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1387 reset in 1892 ms.
Product exploration explored 100000 steps with 1427 reset in 1970 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), true, (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[p1, p1, false, false, p1]
Finished random walk after 109 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), true, (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[p1, p1, false, false, p1]
Stuttering acceptance computed with spot in 199 ms :[p1, p1, false, false, p1]
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:40] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-17 16:00:41] [INFO ] [Real]Absence check using 200 positive place invariants in 238 ms returned sat
[2022-05-17 16:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:00:46] [INFO ] [Real]Absence check using state equation in 4973 ms returned sat
[2022-05-17 16:00:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:00:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 138 ms returned sat
[2022-05-17 16:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:00:49] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2022-05-17 16:00:49] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-17 16:00:49] [INFO ] Added : 0 causal constraints over 0 iterations in 105 ms. Result :sat
Could not prove EG p1
Support contains 300 out of 500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:49] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:00:49] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:49] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:50] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:50] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:00:50] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 413 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 253 ms :[p1, p1, false, false, p1]
Finished random walk after 217 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 5 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 173 ms :[p1, p1, false, false, p1]
Stuttering acceptance computed with spot in 190 ms :[p1, p1, false, false, p1]
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:00:52] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:00:53] [INFO ] [Real]Absence check using 200 positive place invariants in 244 ms returned sat
[2022-05-17 16:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:00:58] [INFO ] [Real]Absence check using state equation in 5049 ms returned sat
[2022-05-17 16:00:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:00:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 145 ms returned sat
[2022-05-17 16:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:01:00] [INFO ] [Nat]Absence check using state equation in 1409 ms returned sat
[2022-05-17 16:01:00] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-17 16:01:01] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 208 ms :[p1, p1, false, false, p1]
Product exploration explored 100000 steps with 1375 reset in 1844 ms.
Product exploration explored 100000 steps with 1389 reset in 1906 ms.
Built C files in :
/tmp/ltsmin13950251922180743756
[2022-05-17 16:01:05] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13950251922180743756
Running compilation step : cd /tmp/ltsmin13950251922180743756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 882 ms.
Running link step : cd /tmp/ltsmin13950251922180743756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13950251922180743756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2477843476181863587.hoa' '--buchi-type=spotba'
LTSmin run took 1187 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000100-LTLCardinality-08 finished in 33037 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:07] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:07] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:07] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:07] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2022-05-17 16:01:07] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:07] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-17 16:01:08] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, true, p0]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], 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 9625 steps with 0 reset in 118 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-09 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:08] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:08] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:08] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:08] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:09] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:09] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 Philosophers-COL-000100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-12 finished in 971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||(G(p1)&&p1)) U !X(X(p2)))&&X(p2)))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:09] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:09] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:09] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-17 16:01:09] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 500 cols
[2022-05-17 16:01:09] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-17 16:01:10] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 410 ms :[true, true, (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), true, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=p2, acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=7 dest: 6}, { cond=p2, acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 1483 ms.
Stack based approach found an accepted trace after 1541 steps with 2 reset with depth 222 and stack size 222 in 23 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-15 finished in 2662 ms.
All properties solved by simple procedures.
Total runtime 54585 ms.

BK_STOP 1652803272267

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="Philosophers-COL-000100"
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 Philosophers-COL-000100, 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 r168-tall-165277016400211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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