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.r325-tall-167889197200475.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 itstools
Input is Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197200475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 19K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K 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-PT-0015-LTLCardinality-00
FORMULA_NAME Referendum-PT-0015-LTLCardinality-01
FORMULA_NAME Referendum-PT-0015-LTLCardinality-02
FORMULA_NAME Referendum-PT-0015-LTLCardinality-03
FORMULA_NAME Referendum-PT-0015-LTLCardinality-04
FORMULA_NAME Referendum-PT-0015-LTLCardinality-05
FORMULA_NAME Referendum-PT-0015-LTLCardinality-06
FORMULA_NAME Referendum-PT-0015-LTLCardinality-07
FORMULA_NAME Referendum-PT-0015-LTLCardinality-08
FORMULA_NAME Referendum-PT-0015-LTLCardinality-09
FORMULA_NAME Referendum-PT-0015-LTLCardinality-10
FORMULA_NAME Referendum-PT-0015-LTLCardinality-11
FORMULA_NAME Referendum-PT-0015-LTLCardinality-12
FORMULA_NAME Referendum-PT-0015-LTLCardinality-13
FORMULA_NAME Referendum-PT-0015-LTLCardinality-14
FORMULA_NAME Referendum-PT-0015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679012317990

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0015
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 00:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 00:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 00:18:39] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-17 00:18:39] [INFO ] Transformed 46 places.
[2023-03-17 00:18:39] [INFO ] Transformed 31 transitions.
[2023-03-17 00:18:39] [INFO ] Found NUPN structural information;
[2023-03-17 00:18:39] [INFO ] Parsed PT model containing 46 places and 31 transitions and 76 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Referendum-PT-0015-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 7 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2023-03-17 00:18:39] [INFO ] Computed 15 place invariants in 12 ms
[2023-03-17 00:18:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-17 00:18:39] [INFO ] Invariant cache hit.
[2023-03-17 00:18:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-17 00:18:39] [INFO ] Invariant cache hit.
[2023-03-17 00:18:39] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 46/46 places, 31/31 transitions.
Support contains 46 out of 46 places after structural reductions.
[2023-03-17 00:18:40] [INFO ] Flatten gal took : 17 ms
[2023-03-17 00:18:40] [INFO ] Flatten gal took : 5 ms
[2023-03-17 00:18:40] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 44 steps, including 2 resets, run visited all 17 properties in 15 ms. (steps per millisecond=2 )
FORMULA Referendum-PT-0015-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
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 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 00:18:40] [INFO ] Invariant cache hit.
[2023-03-17 00:18:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 00:18:40] [INFO ] Invariant cache hit.
[2023-03-17 00:18:40] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-17 00:18:40] [INFO ] Invariant cache hit.
[2023-03-17 00:18:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), false, false, false, (NOT p1), true, false, p1]
Running random walk in product with property : Referendum-PT-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 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45)), p0:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))], 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 7 steps with 1 reset in 2 ms.
FORMULA Referendum-PT-0015-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-00 finished in 572 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 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2023-03-17 00:18:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 00:18:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 00:18:40] [INFO ] Invariant cache hit.
[2023-03-17 00:18:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-17 00:18:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 00:18:40] [INFO ] Invariant cache hit.
[2023-03-17 00:18:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/46 places, 31/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], 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 7757 reset in 295 ms.
Product exploration explored 100000 steps with 7748 reset in 229 ms.
Computed a total of 31 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 31
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 129 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 24 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 165 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-17 00:18:42] [INFO ] Invariant cache hit.
[2023-03-17 00:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:18:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 00:18:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:18:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-17 00:18:42] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-17 00:18:42] [INFO ] Added : 8 causal constraints over 2 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2023-03-17 00:18:42] [INFO ] Invariant cache hit.
[2023-03-17 00:18:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 00:18:42] [INFO ] Invariant cache hit.
[2023-03-17 00:18:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 00:18:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:18:42] [INFO ] Invariant cache hit.
[2023-03-17 00:18:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 31/31 places, 31/31 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 31
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 143 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 30 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
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 171 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-17 00:18:42] [INFO ] Invariant cache hit.
[2023-03-17 00:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 00:18:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 00:18:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 00:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 00:18:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-17 00:18:43] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-17 00:18:43] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7763 reset in 226 ms.
Product exploration explored 100000 steps with 7743 reset in 190 ms.
Built C files in :
/tmp/ltsmin8675534259880694069
[2023-03-17 00:18:43] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2023-03-17 00:18:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:18:43] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2023-03-17 00:18:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:18:43] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2023-03-17 00:18:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 00:18:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8675534259880694069
Running compilation step : cd /tmp/ltsmin8675534259880694069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin8675534259880694069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8675534259880694069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8044461306878834395.hoa' '--buchi-type=spotba'
LTSmin run took 6095 ms.
FORMULA Referendum-PT-0015-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-PT-0015-LTLCardinality-02 finished in 9002 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 16 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 31
Applied a total of 2 rules in 8 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2023-03-17 00:18:49] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 00:18:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-17 00:18:49] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-17 00:18:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:18:50] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/46 places, 31/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-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 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 85900 steps with 13794 reset in 186 ms.
FORMULA Referendum-PT-0015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-03 finished in 385 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 31 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 0 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2023-03-17 00:18:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 00:18:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 00:18:50] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-17 00:18:50] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Referendum-PT-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 s0 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p1:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (...], 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 53 steps with 3 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-04 finished in 277 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 31 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 2 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2023-03-17 00:18:50] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 00:18:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-17 00:18:50] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-17 00:18:50] [INFO ] Invariant cache hit.
[2023-03-17 00:18:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/46 places, 31/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 274 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-PT-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 (EQ s0 1) (LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))), p1:(GT...], 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-PT-0015-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-07 finished in 397 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(p0))&&F(p1))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 6 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 3 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 00:18:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 00:18:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/46 places, 6/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 6/46 places, 6/31 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s4 1)), p1:(OR (EQ s5 0) (EQ s1 1))], 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 12 steps with 2 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-08 finished in 302 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 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 3 ms. Remains 3 /46 variables (removed 43) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 00:18:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-17 00:18:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 3/46 places, 3/31 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s2 1))], 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 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-09 finished in 194 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((p0 U (F(G((p1||X(p2)))) U p2))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 17 transition count 17
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 6 transition count 6
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 6 transition count 6
Applied a total of 65 rules in 3 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-17 00:18:51] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-17 00:18:51] [INFO ] Invariant cache hit.
[2023-03-17 00:18:51] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6/46 places, 6/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 6/46 places, 6/31 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s3 0) (EQ s0 1)), p0:(OR (EQ s4 0) (EQ s5 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16308 reset in 166 ms.
Product exploration explored 100000 steps with 16231 reset in 173 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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 p2 p0 p1), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), true, (X (X (NOT p1))), (F (G p2)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 8 factoid took 292 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLCardinality-10 finished in 1026 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 U p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 5 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Applied a total of 2 rules in 4 ms. Remains 5 /46 variables (removed 41) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-17 00:18:52] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 00:18:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 00:18:52] [INFO ] Invariant cache hit.
[2023-03-17 00:18:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-17 00:18:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 00:18:52] [INFO ] Invariant cache hit.
[2023-03-17 00:18:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/46 places, 5/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 5/46 places, 5/31 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s0 1)), p0:(OR (EQ s0 0) (EQ s3 1))], 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 3 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-15 finished in 148 ms.
All properties solved by simple procedures.
Total runtime 13308 ms.

BK_STOP 1679012333857

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-PT-0015"
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-5348"
echo " Executing tool itstools"
echo " Input is Referendum-PT-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 r325-tall-167889197200475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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