Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850600572.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is FlexibleBarrier-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850600572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 13:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 321K Mar 5 18:22 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-20a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679513574425

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-22 19:32:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 19:32:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:32:57] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-22 19:32:57] [INFO ] Transformed 243 places.
[2023-03-22 19:32:57] [INFO ] Transformed 1064 transitions.
[2023-03-22 19:32:57] [INFO ] Found NUPN structural information;
[2023-03-22 19:32:57] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 36 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
// Phase 1: matrix 682 rows 243 cols
[2023-03-22 19:32:57] [INFO ] Computed 22 place invariants in 20 ms
[2023-03-22 19:32:58] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-22 19:32:58] [INFO ] Invariant cache hit.
[2023-03-22 19:32:58] [INFO ] State equation strengthened by 481 read => feed constraints.
[2023-03-22 19:32:58] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-22 19:32:58] [INFO ] Invariant cache hit.
[2023-03-22 19:32:58] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/243 places, 682/702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 243/243 places, 682/702 transitions.
Support contains 37 out of 243 places after structural reductions.
[2023-03-22 19:32:59] [INFO ] Flatten gal took : 75 ms
[2023-03-22 19:32:59] [INFO ] Flatten gal took : 36 ms
[2023-03-22 19:32:59] [INFO ] Input system was already deterministic with 682 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:32:59] [INFO ] Invariant cache hit.
[2023-03-22 19:32:59] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:00] [INFO ] Invariant cache hit.
[2023-03-22 19:33:00] [INFO ] Implicit Places using invariants in 116 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-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:(AND (EQ s102 1) (EQ s241 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-00 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X(G((G(p0)||p1)))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:00] [INFO ] Invariant cache hit.
[2023-03-22 19:33:00] [INFO ] Implicit Places using invariants in 122 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (EQ s228 1) (EQ s239 1) (EQ s241 1)), p1:(OR (NEQ s228 1) (NEQ s239 1) (NEQ s241 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 358 steps with 0 reset in 14 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-01 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p1))||p0)))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:00] [INFO ] Invariant cache hit.
[2023-03-22 19:33:01] [INFO ] Implicit Places using invariants in 124 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s61 0) (AND (EQ s95 1) (EQ s132 1) (EQ s241 1))), p1:(NEQ s61 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 50000 reset in 1725 ms.
Product exploration explored 100000 steps with 50000 reset in 1666 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-02 finished in 3734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p1))&&p0)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:04] [INFO ] Invariant cache hit.
[2023-03-22 19:33:04] [INFO ] Implicit Places using invariants in 115 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s120 1) (EQ s241 1)), p1:(OR (EQ s95 0) (EQ s168 0) (EQ s241 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 2139 reset in 870 ms.
Stack based approach found an accepted trace after 60 steps with 2 reset with depth 6 and stack size 6 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-03 finished in 1096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((!p0||F(!p1)))&&F((!p2&&X(G((!p2||G(p3)))))))||X(G((!p0||F(!p1))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:05] [INFO ] Invariant cache hit.
[2023-03-22 19:33:05] [INFO ] Implicit Places using invariants in 128 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 506 ms :[(AND p0 p1), (AND p1 p0), (AND p2 (NOT p3) p0 p1), (AND p0 p1 p2), p1, (AND p2 p1 (NOT p3)), false, (AND p1 p2), (AND p2 p1 (NOT p3)), false, (AND p2 p1 (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p2) p0 p1) (AND p0 p1 p3)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p3), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0 p1 p3), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={0, 1} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p1) (AND p1 p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND p2 p1 p3), acceptance={1} source=5 dest: 8}], [{ cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p2 p1 p3), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p2) p1 p3), acceptance={1} source=8 dest: 10}], [{ cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=10 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={0, 1} source=10 dest: 7}, { cond=(AND p2 p1 p3), acceptance={1} source=10 dest: 8}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s35 1) (EQ s120 1) (EQ s241 1)), p0:(AND (EQ s11 1) (EQ s228 1) (EQ s241 1)), p1:(AND (EQ s120 1) (EQ s131 1) (EQ s241 1)), p3:(EQ s11 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 482 reset in 655 ms.
Product exploration explored 100000 steps with 638 reset in 678 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p3))), (X (OR (NOT p2) p3)), (X (NOT (AND p2 p0 p1 p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p0 p1) (AND p0 p1 p3)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 p0 p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p0 p1) (AND p0 p1 p3))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1 p3)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0 p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) p3))), (X (X (NOT (OR (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p2) p1) (AND p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND p1 p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 23 factoid took 4626 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 885 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 682 rows 242 cols
[2023-03-22 19:33:13] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-22 19:33:13] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 p3))), (X (OR (NOT p2) p3)), (X (NOT (AND p2 p0 p1 p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p2) p0 p1) (AND p0 p1 p3)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p2 p0 p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p0 p1) (AND p0 p1 p3))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1 p3)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0 p1 (NOT p3))))), (G (NOT (AND p1 p2 p0 (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) p3))), (X (X (NOT (OR (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p2) p1) (AND p1 p3)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND p1 p3))))), (X (X p1)), (X (X (NOT p1))), (F (OR (AND p1 (NOT p2)) (AND p1 p3))), (F (AND p1 p2 p0)), (F (AND p1 p2 (NOT p3))), (F (AND p1 p2 p0 p3)), (F (AND p1 (NOT p2) p3)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 (NOT p2) p0)), (F (AND p1 p2)), (F p2), (F (NOT (OR (NOT p2) p3))), (F (OR (AND p1 (NOT p2) p0) (AND p1 p0 p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p2))), (F (AND p1 p2 p3))]
Knowledge based reduction with 24 factoid took 2490 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Stuttering acceptance computed with spot in 288 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Support contains 6 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:16] [INFO ] Invariant cache hit.
[2023-03-22 19:33:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-22 19:33:16] [INFO ] Invariant cache hit.
[2023-03-22 19:33:16] [INFO ] State equation strengthened by 381 read => feed constraints.
[2023-03-22 19:33:16] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-22 19:33:16] [INFO ] Invariant cache hit.
[2023-03-22 19:33:17] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 242/242 places, 682/682 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0 p2))), (X (OR (NOT p2) p3)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) p3))), (X (X (NOT (OR (NOT p2) p3)))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 p3)))))]
Knowledge based reduction with 11 factoid took 1433 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter sensitive) to 7 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 530 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Finished random walk after 59 steps, including 0 resets, run visited all 13 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0 p2))), (X (OR (NOT p2) p3)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (NOT p2) p3))), (X (X (NOT (OR (NOT p2) p3)))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 p3))))), (F (AND p1 p2 p3)), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2))), (F p2), (F (AND p1 p2 p0)), (F (OR (AND p1 (NOT p2)) (AND p1 p3))), (F (AND p1 (NOT p2) p3)), (F (AND p1 (NOT p2) p0)), (F (NOT (OR (NOT p2) p3))), (F (AND p1 p0)), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p1 p2))]
Knowledge based reduction with 11 factoid took 1158 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter sensitive) to 7 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Stuttering acceptance computed with spot in 305 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Stuttering acceptance computed with spot in 321 ms :[(AND p2 (NOT p3) p1 p0), (AND p2 (NOT p3) p1 p0), (AND p0 p1 p2), (AND p2 p1 (NOT p3)), (AND p1 p2), (AND p2 p1 (NOT p3)), (AND p2 p1 (NOT p3))]
Product exploration explored 100000 steps with 11 reset in 474 ms.
Stack based approach found an accepted trace after 55566 steps with 26 reset with depth 74 and stack size 74 in 292 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-07 finished in 16310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((F(G(p1)) U G(p2))))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2023-03-22 19:33:22] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-22 19:33:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-22 19:33:22] [INFO ] Invariant cache hit.
[2023-03-22 19:33:22] [INFO ] State equation strengthened by 481 read => feed constraints.
[2023-03-22 19:33:22] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-22 19:33:22] [INFO ] Invariant cache hit.
[2023-03-22 19:33:22] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 747 ms. Remains : 243/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s163 1) (EQ s242 1)), p2:(AND (EQ s119 1) (EQ s132 1) (EQ s241 1)), p1:(AND (EQ s23 1) (EQ s168 1) (EQ s241 1))], 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 158 reset in 648 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-08 finished in 1668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!(F(p2)&&p1)&&p0))) U p3))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:23] [INFO ] Invariant cache hit.
[2023-03-22 19:33:23] [INFO ] Implicit Places using invariants in 116 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p3), (OR (NOT p0) (NOT p3) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, p2]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s36 1) (EQ s179 1) (EQ s241 1)), p0:(AND (EQ s47 1) (EQ s96 1) (EQ s241 1)), p1:(AND (EQ s35 1) (EQ s120 1) (EQ s241 1)), p2:(AND (EQ s48 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-09 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(G(p0))||(!p1&&X(G(p1))))) U p1))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:24] [INFO ] Invariant cache hit.
[2023-03-22 19:33:24] [INFO ] Implicit Places using invariants in 123 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, 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: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s60 1) (EQ s227 1) (EQ s241 1)), p0:(NEQ s142 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 163 steps with 0 reset in 6 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-10 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(((X(F(!p1))&&G(p2))||G(F(!p1)))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-22 19:33:24] [INFO ] Invariant cache hit.
[2023-03-22 19:33:24] [INFO ] Implicit Places using invariants in 120 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) p1), (AND p0 p1), p1, (AND p0 (NOT p2) p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s47 0) (EQ s204 0) (EQ s241 0)) (OR (EQ s222 0) (EQ s241 0))), p2:(AND (EQ s107 1) (EQ s144 1) (EQ s241 1)), p1:(AND (EQ s47 1) (EQ s204 1...], 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 2328 reset in 1025 ms.
Stack based approach found an accepted trace after 3098 steps with 21 reset with depth 25 and stack size 25 in 24 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-11 finished in 1501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 193 edges and 243 vertex of which 54 / 243 are part of one of the 18 SCC in 5 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 117 place count 149 transition count 452
Drop transitions removed 206 transitions
Redundant transition composition rules discarded 206 transitions
Iterating global reduction 0 with 206 rules applied. Total rules applied 323 place count 149 transition count 246
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 325 place count 149 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 327 place count 147 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 329 place count 147 transition count 244
Applied a total of 329 rules in 81 ms. Remains 147 /243 variables (removed 96) and now considering 244/682 (removed 438) transitions.
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 191 transitions (discarded 53 similar events)
// Phase 1: matrix 191 rows 147 cols
[2023-03-22 19:33:26] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants in 112 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/243 places, 244/682 transitions.
Graph (trivial) has 198 edges and 146 vertex of which 54 / 146 are part of one of the 18 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 110 transition count 152
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 90 transition count 152
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 90 transition count 132
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 70 transition count 132
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 48 transition count 110
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 145 place count 48 transition count 90
Applied a total of 145 rules in 13 ms. Remains 48 /146 variables (removed 98) and now considering 90/244 (removed 154) transitions.
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 53 transitions (discarded 37 similar events)
// Phase 1: matrix 53 rows 48 cols
[2023-03-22 19:33:26] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 53 transitions (discarded 37 similar events)
[2023-03-22 19:33:26] [INFO ] Invariant cache hit.
[2023-03-22 19:33:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/243 places, 90/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 48/243 places, 90/682 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s43 1) (EQ s47 1)), p1:(NEQ s44 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-12 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X((X(p1) U p2))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2023-03-22 19:33:26] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants in 124 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s202 1), p0:(EQ s229 1), p1:(AND (EQ s47 1) (EQ s72 1) (EQ s241 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-13 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2)&&F(G(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 185 edges and 243 vertex of which 42 / 243 are part of one of the 14 SCC in 0 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 155 transition count 516
Drop transitions removed 253 transitions
Redundant transition composition rules discarded 253 transitions
Iterating global reduction 0 with 253 rules applied. Total rules applied 374 place count 155 transition count 263
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 377 place count 155 transition count 263
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 380 place count 152 transition count 260
Iterating global reduction 0 with 3 rules applied. Total rules applied 383 place count 152 transition count 260
Applied a total of 383 rules in 40 ms. Remains 152 /243 variables (removed 91) and now considering 260/682 (removed 422) transitions.
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 227 transitions (discarded 33 similar events)
// Phase 1: matrix 227 rows 152 cols
[2023-03-22 19:33:26] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants in 96 ms returned [151]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/243 places, 260/682 transitions.
Graph (trivial) has 194 edges and 151 vertex of which 42 / 151 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 123 transition count 184
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 103 transition count 184
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 103 transition count 164
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 83 transition count 164
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 133 place count 57 transition count 138
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 57 transition count 118
Applied a total of 153 rules in 10 ms. Remains 57 /151 variables (removed 94) and now considering 118/260 (removed 142) transitions.
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 93 transitions (discarded 25 similar events)
// Phase 1: matrix 93 rows 57 cols
[2023-03-22 19:33:26] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 19:33:26] [INFO ] Flow matrix only has 93 transitions (discarded 25 similar events)
[2023-03-22 19:33:26] [INFO ] Invariant cache hit.
[2023-03-22 19:33:26] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-22 19:33:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/243 places, 118/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 57/243 places, 118/682 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s48 0) (EQ s56 0)), p1:(OR (NEQ s16 1) (NEQ s37 1) (NEQ s56 1)), p2:(AND (EQ s7 1) (EQ s48 1) (EQ s56 1)), p3:(AND (EQ s32 1) (EQ s44...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-14 finished in 461 ms.
All properties solved by simple procedures.
Total runtime 29659 ms.

BK_STOP 1679513615344

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838850600572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;