Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 11K Apr 29 20:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 29 20:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 20:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 20:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:33 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 AirplaneLD-COL-0050-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652658090363

Running Version 202205111006
[2022-05-15 23:41:31] [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-15 23:41:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:41:31] [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-15 23:41:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:41:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2022-05-15 23:41:32] [INFO ] Detected 3 constant HL places corresponding to 152 PT places.
[2022-05-15 23:41:32] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 369 PT places and 612.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA AirplaneLD-COL-0050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:41:32] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2022-05-15 23:41:32] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA AirplaneLD-COL-0050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
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.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
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 10000 steps, including 1259 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 335 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 352 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 336 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 343 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 389 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 390 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 329 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 14 rows 17 cols
[2022-05-15 23:41:33] [INFO ] Computed 3 place invariants in 9 ms
[2022-05-15 23:41:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:41:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 9 ms returned sat
[2022-05-15 23:41:33] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:4
[2022-05-15 23:41:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:41:33] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA AirplaneLD-COL-0050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:41:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 23:41:33] [INFO ] Flatten gal took : 15 ms
FORMULA AirplaneLD-COL-0050-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:41:33] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:100) in guard (OR (GEQ $A 49) (EQ $A 99))introduces in Altitude(100) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:100) in guard (AND (LT $A 49) (NEQ $A 99))introduces in Altitude(100) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition Partition [nbSubs=2, partition=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 100 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 49) (EQ $A 99)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 49) (NEQ $A 99)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:50) in guard (OR (LEQ $S 24) (EQ $S 49))introduces in Speed(50) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:50) in guard (AND (GT $S 24) (NEQ $S 49))introduces in Speed(50) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:50) in guard (OR (LEQ $S 24) (EQ $S 49))introduces in Speed(50) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:50) in guard (AND (GT $S 24) (NEQ $S 49))introduces in Speed(50) partition with 2 elements
Sort wr.t. initial and guards Speed has partition Partition [nbSubs=2, partition=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 50 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 24) (EQ $S 49)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 24) (NEQ $S 49)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 24) (EQ $S 49)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 24) (NEQ $S 49)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2022-05-15 23:41:33] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 13 ms.
[2022-05-15 23:41:33] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 14 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2022-05-15 23:41:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 23:41:33] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 20 rows 23 cols
[2022-05-15 23:41:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 23:41:33] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 23 cols
[2022-05-15 23:41:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 20/20 transitions.
Support contains 14 out of 23 places after structural reductions.
[2022-05-15 23:41:33] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:41:34] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:41:34] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 221 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 20 rows 23 cols
[2022-05-15 23:41:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 23:41:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:41:34] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-15 23:41:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:41:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:41:34] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 20
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 12 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 6 ms. Remains 12 /23 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 23:41:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:34] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/23 places, 12/20 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 7 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 23:41:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:41:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 23:41:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:41:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/23 places, 10/20 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/23 places, 10/20 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-00 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 (ADD s7 s8))], 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 9 steps with 1 reset in 2 ms.
FORMULA AirplaneLD-COL-0050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0050-LTLCardinality-00 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 5 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:41:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:34] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/23 places, 18/20 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-04 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 s2 s6)], 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 AirplaneLD-COL-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0050-LTLCardinality-04 finished in 115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:41:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:34] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:35] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/23 places, 18/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/23 places, 18/20 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0050-LTLCardinality-08 finished in 167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 19 transition count 17
Applied a total of 6 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 17/20 (removed 3) transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-15 23:41:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/23 places, 17/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 16
Applied a total of 2 rules in 4 ms. Remains 17 /18 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 17 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 17 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/23 places, 16/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 15/23 places, 15/20 transitions.
Finished structural reductions, in 3 iterations. Remains : 15/23 places, 15/20 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s5)], 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 16318 reset in 232 ms.
Product exploration explored 100000 steps with 16325 reset in 136 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 15
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:41:36] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-15 23:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-15 23:41:36] [INFO ] Computed and/alt/rep : 7/14/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:41:36] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:36] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 23:41:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 15/15 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 15
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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 23:41:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:41:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:41:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-15 23:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:41:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-15 23:41:36] [INFO ] Computed and/alt/rep : 7/14/7 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-15 23:41:36] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16234 reset in 99 ms.
Product exploration explored 100000 steps with 16342 reset in 179 ms.
Built C files in :
/tmp/ltsmin5833808241432370606
[2022-05-15 23:41:36] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2022-05-15 23:41:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:41:36] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2022-05-15 23:41:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:41:36] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2022-05-15 23:41:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:41:36] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5833808241432370606
Running compilation step : cd /tmp/ltsmin5833808241432370606;'/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 180 ms.
Running link step : cd /tmp/ltsmin5833808241432370606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5833808241432370606;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2996525855135202767.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA AirplaneLD-COL-0050-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0050-LTLCardinality-11 finished in 2155 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(X(G(p0)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 2 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /23 variables (removed 21) and now considering 2/20 (removed 18) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:41:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:41:37] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:41:37] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:41:37] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 23:41:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-15 23:41:37] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 2/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/23 places, 2/20 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0050-LTLCardinality-12 finished in 101 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(p0)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:41:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:41:37] [INFO ] Implicit Places using invariants in 26 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 18/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/23 places, 18/20 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s13 s14) s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0050-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0050-LTLCardinality-13 finished in 120 ms.
All properties solved by simple procedures.
Total runtime 5757 ms.

BK_STOP 1652658097898

--------------------
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="AirplaneLD-COL-0050"
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 AirplaneLD-COL-0050, 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 r006-tajo-165245688900187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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