fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689000243
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AirplaneLD-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
287.235 11608.00 21058.00 115.90 FFTFFFTTTFTFTFFF normal

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-165245689000243.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-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689000243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 12K Apr 29 20:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 20:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 20:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 29 20:43 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 7.5K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 48K 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-PT-0010-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652658427606

Running Version 202205111006
[2022-05-15 23:47:09] [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:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:47:09] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-05-15 23:47:09] [INFO ] Transformed 89 places.
[2022-05-15 23:47:09] [INFO ] Transformed 88 transitions.
[2022-05-15 23:47:09] [INFO ] Parsed PT model containing 89 places and 88 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 32 places and 0 transitions.
FORMULA AirplaneLD-PT-0010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 88
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 38 transition count 70
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 38 transition count 70
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 55 place count 38 transition count 52
Applied a total of 55 rules in 22 ms. Remains 38 /57 variables (removed 19) and now considering 52/88 (removed 36) transitions.
// Phase 1: matrix 52 rows 38 cols
[2022-05-15 23:47:10] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 23:47:10] [INFO ] Implicit Places using invariants in 193 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/57 places, 52/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 37/57 places, 52/88 transitions.
Support contains 30 out of 37 places after structural reductions.
[2022-05-15 23:47:10] [INFO ] Flatten gal took : 31 ms
[2022-05-15 23:47:10] [INFO ] Flatten gal took : 8 ms
[2022-05-15 23:47:10] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 137 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 37 cols
[2022-05-15 23:47:10] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:47:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:47:11] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-05-15 23:47:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 23:47:11] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA AirplaneLD-PT-0010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 37 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 37 transition count 52
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' '!(G((X(p0)||G(X(p0)))))'
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 52
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 18 transition count 35
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 18 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 53 place count 18 transition count 18
Applied a total of 53 rules in 3 ms. Remains 18 /37 variables (removed 19) and now considering 18/52 (removed 34) transitions.
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 23:47:11] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 23:47:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18/37 places, 18/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/37 places, 18/52 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-00 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 1 s16)], 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 14 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-00 finished in 495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(false U G(X((true U true)))))))'
Support contains 0 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 66 edges and 37 vertex of which 0 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 52 output transitions
Drop transitions removed 52 transitions
Applied a total of 1 rules in 5 ms. Remains 0 /37 variables (removed 37) and now considering 0/52 (removed 52) transitions.
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:11] [INFO ] Implicit Places using invariants in 5 ms returned []
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 23:47:11] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 23:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:11] [INFO ] Dead Transitions using invariants and state equation in 6 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/37 places, 0/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/37 places, 0/52 transitions.
Stuttering acceptance computed with spot in 20 ms :[true]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-05 finished in 104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||G(X(F(p1)))))'
Support contains 22 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 52/52 transitions.
Graph (complete) has 66 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 36 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 35 transition count 51
Applied a total of 3 rules in 5 ms. Remains 35 /37 variables (removed 2) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:11] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:47:11] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-05-15 23:47:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:12] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:47:13] [INFO ] Dead Transitions using invariants and state equation in 1863 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/37 places, 51/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/37 places, 51/52 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s32 s31), p1:(AND (LEQ s32 s31) (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15648 reset in 309 ms.
Product exploration explored 100000 steps with 15742 reset in 236 ms.
Computed a total of 35 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 51
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 p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 523 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 21 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 463 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Support contains 22 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:16] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2022-05-15 23:47:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 35 cols
[2022-05-15 23:47:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:16] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 51/51 transitions.
Computed a total of 35 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 51
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 : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 15733 reset in 192 ms.
Product exploration explored 100000 steps with 15836 reset in 233 ms.
Built C files in :
/tmp/ltsmin1438830768614060913
[2022-05-15 23:47:17] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-15 23:47:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:47:17] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-15 23:47:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:47:17] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-15 23:47:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:47:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1438830768614060913
Running compilation step : cd /tmp/ltsmin1438830768614060913;'/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 303 ms.
Running link step : cd /tmp/ltsmin1438830768614060913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1438830768614060913;'/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/stateBased3422548983590123028.hoa' '--buchi-type=spotba'
LTSmin run took 199 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0010-LTLCardinality-06 finished in 6132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 52
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 18 transition count 35
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 18 transition count 35
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 53 place count 18 transition count 18
Applied a total of 53 rules in 2 ms. Remains 18 /37 variables (removed 19) and now considering 18/52 (removed 34) transitions.
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:18] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 18/37 places, 18/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/37 places, 18/52 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-07 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:(OR (LEQ s16 s5) (LEQ 3 (ADD s9 s10)))], 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]]
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0010-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0010-LTLCardinality-07 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))||(!(G(!p0) U false)&&G(p1)&&p0))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 52
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 20 transition count 36
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 20 transition count 36
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 49 place count 20 transition count 20
Applied a total of 49 rules in 4 ms. Remains 20 /37 variables (removed 17) and now considering 20/52 (removed 32) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:18] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:18] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:47:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/37 places, 20/52 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/37 places, 20/52 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s16 s0), p1:(GT s18 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLCardinality-13 finished in 281 ms.
All properties solved by simple procedures.
Total runtime 9313 ms.

BK_STOP 1652658439214

--------------------
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-PT-0010"
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-PT-0010, 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-165245689000243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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