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.r096-smll-165260575600003.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 FlexibleBarrier-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575600003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:13 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.7K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 23K 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 FlexibleBarrier-PT-04a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652606621493

Running Version 202205111006
[2022-05-15 09:23:44] [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 09:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 09:23:44] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-05-15 09:23:44] [INFO ] Transformed 51 places.
[2022-05-15 09:23:44] [INFO ] Transformed 88 transitions.
[2022-05-15 09:23:44] [INFO ] Found NUPN structural information;
[2022-05-15 09:23:44] [INFO ] Parsed PT model containing 51 places and 88 transitions in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 34 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:44] [INFO ] Computed 6 place invariants in 11 ms
[2022-05-15 09:23:45] [INFO ] Implicit Places using invariants in 476 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 542 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/51 places, 74/78 transitions.
Support contains 18 out of 49 places after structural reductions.
[2022-05-15 09:23:45] [INFO ] Flatten gal took : 55 ms
[2022-05-15 09:23:45] [INFO ] Flatten gal took : 30 ms
[2022-05-15 09:23:45] [INFO ] Input system was already deterministic with 74 transitions.
Finished random walk after 58 steps, including 0 resets, run visited all 13 properties in 61 ms. (steps per millisecond=0 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||(F(p2) U (X(X(p2))&&p3))))'
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:46] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 09:23:46] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:46] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 09:23:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 09:23:46] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 1122 ms :[(OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 7}, { cond=p3, acceptance={0} source=2 dest: 8}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={0} source=3 dest: 9}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 10}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=3 dest: 11}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 12}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=7 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 10}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 11}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=11 dest: 8}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=12 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0} source=12 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=12 dest: 6}]], initial=1, aps=[p3:(EQ s11 1), p0:(OR (EQ s23 0) (EQ s1 1)), p1:(EQ s36 1), p2:(OR (EQ s29 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 598 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3) (NOT p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) p0 (NOT p1) p2)
Knowledge based reduction with 19 factoid took 1236 ms. Reduced automaton from 13 states, 36 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-00 finished in 3746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:49] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 09:23:49] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 09:23:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:50] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 09:23:50] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s26 1)], 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][false, false]]
Product exploration explored 100000 steps with 1006 reset in 609 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-01 finished in 1142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(p0))||p1))))'
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:50] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 09:23:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s42 0) (NEQ s24 1)), p0:(AND (EQ s31 0) (EQ s33 1))], 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]]
Product exploration explored 100000 steps with 3968 reset in 191 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 10 and stack size 10 in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-02 finished in 590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(X(p1))))'
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:51] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:51] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 09:23:51] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s18 1)), p1:(OR (EQ s28 0) (EQ s47 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-08 finished in 790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))||F(F(p1))))'
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 09:23:52] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 09:23:52] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:52] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 09:23:52] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s44 0) (EQ s47 1)), p0:(AND (EQ s9 0) (EQ s36 1))], 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]]
Product exploration explored 100000 steps with 14014 reset in 199 ms.
Stack based approach found an accepted trace after 33 steps with 5 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-09 finished in 646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||X(p1))))'
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 09:23:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 09:23:53] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 49 cols
[2022-05-15 09:23:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 09:23:53] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 74/74 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s46 1)), p1:(OR (EQ s9 0) (EQ s5 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-04a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLCardinality-14 finished in 801 ms.
All properties solved by simple procedures.
Total runtime 9791 ms.

BK_STOP 1652606634003

--------------------
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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r096-smll-165260575600003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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