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.r327-tall-167889199600411.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 lolaxred
Input is Referendum-COL-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199600411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7K 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 Referendum-COL-0015-LTLCardinality-00
FORMULA_NAME Referendum-COL-0015-LTLCardinality-01
FORMULA_NAME Referendum-COL-0015-LTLCardinality-02
FORMULA_NAME Referendum-COL-0015-LTLCardinality-03
FORMULA_NAME Referendum-COL-0015-LTLCardinality-04
FORMULA_NAME Referendum-COL-0015-LTLCardinality-05
FORMULA_NAME Referendum-COL-0015-LTLCardinality-06
FORMULA_NAME Referendum-COL-0015-LTLCardinality-07
FORMULA_NAME Referendum-COL-0015-LTLCardinality-08
FORMULA_NAME Referendum-COL-0015-LTLCardinality-09
FORMULA_NAME Referendum-COL-0015-LTLCardinality-10
FORMULA_NAME Referendum-COL-0015-LTLCardinality-11
FORMULA_NAME Referendum-COL-0015-LTLCardinality-12
FORMULA_NAME Referendum-COL-0015-LTLCardinality-13
FORMULA_NAME Referendum-COL-0015-LTLCardinality-14
FORMULA_NAME Referendum-COL-0015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679048908057

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0015
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:28:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:28:29] [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.
[2023-03-17 10:28:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 10:28:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2023-03-17 10:28:30] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 10:28:30] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2023-03-17 10:28:30] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA Referendum-COL-0015-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10007 steps, including 555 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:28:30] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-17 10:28:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-17 10:28:30] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Referendum-COL-0015-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 10:28:30] [INFO ] Flatten gal took : 11 ms
[2023-03-17 10:28:30] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]]] introduces in Voters(15) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 15
[2023-03-17 10:28:30] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 6 ms.
[2023-03-17 10:28:30] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 5 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:28:30] [INFO ] Invariant cache hit.
[2023-03-17 10:28:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 10:28:30] [INFO ] Invariant cache hit.
[2023-03-17 10:28:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 10:28:30] [INFO ] Invariant cache hit.
[2023-03-17 10:28:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-17 10:28:30] [INFO ] Flatten gal took : 2 ms
[2023-03-17 10:28:30] [INFO ] Flatten gal took : 1 ms
[2023-03-17 10:28:30] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 71 steps, including 3 resets, run visited all 13 properties in 2 ms. (steps per millisecond=35 )
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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' '!(X((X(X((p0 U p1)))||G(!p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:28:30] [INFO ] Invariant cache hit.
[2023-03-17 10:28:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:28:31] [INFO ] Invariant cache hit.
[2023-03-17 10:28:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-17 10:28:31] [INFO ] Invariant cache hit.
[2023-03-17 10:28:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p1), false, false, false, (NOT p1), true, false, p1]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 4}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(GT 2 s2), p0:(LEQ 2 s1)], 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 8 reset in 3 ms.
FORMULA Referendum-COL-0015-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-00 finished in 554 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))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:28:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 10:28:31] [INFO ] Invariant cache hit.
[2023-03-17 10:28:31] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:28:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:31] [INFO ] Invariant cache hit.
[2023-03-17 10:28:31] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], 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][true]]
Product exploration explored 100000 steps with 7758 reset in 157 ms.
Product exploration explored 100000 steps with 7760 reset in 88 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2023-03-17 10:28:32] [INFO ] Invariant cache hit.
[2023-03-17 10:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:28:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:28:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-17 10:28:32] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:28:32] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:28:32] [INFO ] Invariant cache hit.
[2023-03-17 10:28:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 10:28:32] [INFO ] Invariant cache hit.
[2023-03-17 10:28:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-17 10:28:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:32] [INFO ] Invariant cache hit.
[2023-03-17 10:28:32] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-17 10:28:33] [INFO ] Invariant cache hit.
[2023-03-17 10:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:28:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:28:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:28:33] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:28:33] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7762 reset in 59 ms.
Stuttering criterion allowed to conclude after 43761 steps with 3401 reset in 23 ms.
FORMULA Referendum-COL-0015-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-02 finished in 2111 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(F(p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:28:33] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:28:33] [INFO ] Invariant cache hit.
[2023-03-17 10:28:33] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2023-03-17 10:28:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:33] [INFO ] Invariant cache hit.
[2023-03-17 10:28:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16219 reset in 137 ms.
Stuttering criterion allowed to conclude after 42317 steps with 6730 reset in 65 ms.
FORMULA Referendum-COL-0015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-03 finished in 334 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) U (p0&&G(p1)))))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:28:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 10:28:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:28:33] [INFO ] Invariant cache hit.
[2023-03-17 10:28:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:28:33] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s1), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 121 steps with 7 reset in 0 ms.
FORMULA Referendum-COL-0015-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-04 finished in 246 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' '!(X((F(p0)&&F((!p1&&(!p1 U X(p2)))))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:28:34] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p0), (OR (NOT p2) p1), (NOT p2), (NOT p2)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 1 s2) (LEQ s1 s0)), p1:(GT s1 s0), p2:(LEQ s1 s2)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0015-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-07 finished in 369 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(G((p0&&(p1 U !p2)))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:28:34] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 10:28:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) p2), p2]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GT s2 s3), p0:(LEQ s1 s2), p1:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0015-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-08 finished in 174 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' '!((X(F(!p0)) U (!p1&&G(p2))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:28:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) p1), p0, (NOT p2)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1 s2), p2:(LEQ s3 s0), p0:(OR (LEQ s2 s0) (LEQ s2 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 2 reset in 0 ms.
FORMULA Referendum-COL-0015-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-09 finished in 208 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(G(p0)))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 1 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /4 variables (removed 3) and now considering 1/3 (removed 2) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-17 10:28:34] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 10:28:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:34] [INFO ] Invariant cache hit.
[2023-03-17 10:28:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/4 places, 1/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 1/4 places, 1/3 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0015-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0015-LTLCardinality-10 finished in 136 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(F((G(!p1)||p0))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:28:35] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:28:35] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:28:35] [INFO ] Invariant cache hit.
[2023-03-17 10:28:35] [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.
[2023-03-17 10:28:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:28:35] [INFO ] Invariant cache hit.
[2023-03-17 10:28:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Referendum-COL-0015-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s1), p0:(OR (GT s1 s0) (GT s0 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5882 reset in 147 ms.
Product exploration explored 100000 steps with 5882 reset in 175 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10007 steps, including 555 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:28:35] [INFO ] Invariant cache hit.
[2023-03-17 10:28:35] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0015-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0015-LTLCardinality-15 finished in 1121 ms.
All properties solved by simple procedures.
Total runtime 6658 ms.
ITS solved all properties within timeout

BK_STOP 1679048917473

--------------------
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="Referendum-COL-0015"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Referendum-COL-0015, 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 r327-tall-167889199600411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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