Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 15K Apr 30 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 30 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 30 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 30 05: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 8.1K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 26K 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 CSRepetitions-PT-02-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652669647075

Running Version 202205111006
[2022-05-16 02:54:08] [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-16 02:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:54:08] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-05-16 02:54:08] [INFO ] Transformed 23 places.
[2022-05-16 02:54:08] [INFO ] Transformed 28 transitions.
[2022-05-16 02:54:08] [INFO ] Parsed PT model containing 23 places and 28 transitions in 151 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 3 formulas.
FORMULA CSRepetitions-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:08] [INFO ] Computed 6 place invariants in 10 ms
[2022-05-16 02:54:08] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:08] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:08] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:08] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Support contains 19 out of 23 places after structural reductions.
[2022-05-16 02:54:08] [INFO ] Flatten gal took : 18 ms
[2022-05-16 02:54:08] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:54:08] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10000 steps, including 585 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:09] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 02:54:09] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA CSRepetitions-PT-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 9 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:10] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:10] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (ADD s3 s6 s21 s22) (ADD s9 s10 s12 s14)), p0:(LEQ 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 2 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-02 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p0)))))'
Support contains 14 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:10] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:10] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:10] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-16 02:54:10] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ (ADD s8 s17) (ADD s3 s6 s21 s22)), p0:(GT (ADD s3 s6 s21 s22) (ADD s1 s2 s5 s7 s11 s13 s15 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-02-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-02-LTLCardinality-04 finished in 803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!X(p0) U F(X(!(p0 U p1))))))'
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-16 02:54:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 82 ms :[p1, p1]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s8 s17) (ADD s9 s10 s12 s14)), p1:(LEQ 1 (ADD s3 s6 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5241 reset in 188 ms.
Stack based approach found an accepted trace after 55 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-05 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(X(G(F(p1)))))))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s20 (ADD s3 s6 s21 s22)), p1:(GT s20 (ADD s8 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 4 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-06 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U !(F(p1)||!p0)))))'
Support contains 19 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:11] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s20 (ADD s9 s10 s12 s14)), p1:(AND (LEQ (ADD s1 s2 s5 s7 s11 s13 s15 s18) (ADD s3 s6 s21 s22)) (LEQ (ADD s8 s17) (ADD s1 s2 s5 s7 s11 s13 s15 s18)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-07 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 12 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 10 transition count 15
Applied a total of 24 rules in 19 ms. Remains 10 /23 variables (removed 13) and now considering 15/28 (removed 13) transitions.
[2022-05-16 02:54:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 02:54:12] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:54:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-16 02:54:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 02:54:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:54:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 02:54:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 02:54:12] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 02:54:12] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-16 02:54:12] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:54:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/23 places, 15/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/23 places, 15/28 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 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 23675 reset in 115 ms.
Stack based approach found an accepted trace after 5 steps with 1 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-13 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(G(p0))&&G(p0)) U p1))||G(p1)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:12] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:12] [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.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s11 s21), p0:(LEQ 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 6 factoid took 171 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-02-LTLCardinality-14 finished in 634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(!F(p0) U !X(p1)))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:13] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:13] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s8 s10), p1:(LEQ s22 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31062 reset in 87 ms.
Stack based approach found an accepted trace after 209 steps with 69 reset with depth 5 and stack size 5 in 0 ms.
FORMULA CSRepetitions-PT-02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLCardinality-15 finished in 309 ms.
All properties solved by simple procedures.
Total runtime 5124 ms.

BK_STOP 1652669653453

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="CSRepetitions-PT-02"
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 CSRepetitions-PT-02, 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 r024-tall-165251918800619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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