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.r295-tall-167873947400060.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 lolaxred
Input is PhaseVariation-PT-D20CS100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947400060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 26 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13M Mar 5 18:23 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 PhaseVariation-PT-D20CS100-LTLFireability-00
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-01
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-02
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-03
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-04
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-05
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-06
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-07
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-08
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-09
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-10
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-11
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-12
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-13
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-14
FORMULA_NAME PhaseVariation-PT-D20CS100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678779421968

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhaseVariation-PT-D20CS100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 07:37:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 07:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:37:03] [INFO ] Load time of PNML (sax parser for PT used): 515 ms
[2023-03-14 07:37:03] [INFO ] Transformed 1202 places.
[2023-03-14 07:37:04] [INFO ] Transformed 13457 transitions.
[2023-03-14 07:37:04] [INFO ] Parsed PT model containing 1202 places and 13457 transitions and 93395 arcs in 742 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 1199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1199/1199 places, 13405/13405 transitions.
Drop transitions removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 0 with 256 rules applied. Total rules applied 256 place count 1199 transition count 13149
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 264 place count 1191 transition count 13085
Iterating global reduction 0 with 8 rules applied. Total rules applied 272 place count 1191 transition count 13085
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 280 place count 1191 transition count 13077
Applied a total of 280 rules in 926 ms. Remains 1191 /1199 variables (removed 8) and now considering 13077/13405 (removed 328) transitions.
[2023-03-14 07:37:05] [INFO ] Flow matrix only has 791 transitions (discarded 12286 similar events)
// Phase 1: matrix 791 rows 1191 cols
[2023-03-14 07:37:05] [INFO ] Computed 400 place invariants in 40 ms
[2023-03-14 07:37:09] [INFO ] Dead Transitions using invariants and state equation in 4369 ms found 1564 transitions.
Found 1564 dead transitions using SMT.
Drop transitions removed 1564 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1564 transitions.
[2023-03-14 07:37:09] [INFO ] Flow matrix only has 791 transitions (discarded 10722 similar events)
[2023-03-14 07:37:09] [INFO ] Invariant cache hit.
[2023-03-14 07:37:10] [INFO ] Implicit Places using invariants in 1029 ms returned []
Implicit Place search using SMT only with invariants took 1030 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1191/1199 places, 11513/13405 transitions.
Discarding 358 places :
Symmetric choice reduction at 0 with 358 rule applications. Total rules 358 place count 833 transition count 6293
Iterating global reduction 0 with 358 rules applied. Total rules applied 716 place count 833 transition count 6293
Ensure Unique test removed 2880 transitions
Reduce isomorphic transitions removed 2880 transitions.
Iterating post reduction 0 with 2880 rules applied. Total rules applied 3596 place count 833 transition count 3413
Applied a total of 3596 rules in 229 ms. Remains 833 /1191 variables (removed 358) and now considering 3413/11513 (removed 8100) transitions.
[2023-03-14 07:37:10] [INFO ] Flow matrix only has 433 transitions (discarded 2980 similar events)
// Phase 1: matrix 433 rows 833 cols
[2023-03-14 07:37:10] [INFO ] Computed 400 place invariants in 14 ms
[2023-03-14 07:37:11] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-14 07:37:11] [INFO ] Flow matrix only has 433 transitions (discarded 2980 similar events)
[2023-03-14 07:37:11] [INFO ] Invariant cache hit.
[2023-03-14 07:37:11] [INFO ] State equation strengthened by 425 read => feed constraints.
[2023-03-14 07:37:13] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 833/1199 places, 3413/13405 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9323 ms. Remains : 833/1199 places, 3413/13405 transitions.
Support contains 67 out of 833 places after structural reductions.
[2023-03-14 07:37:14] [INFO ] Flatten gal took : 249 ms
[2023-03-14 07:37:14] [INFO ] Flatten gal took : 166 ms
[2023-03-14 07:37:14] [INFO ] Input system was already deterministic with 3413 transitions.
Support contains 61 out of 833 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-14 07:37:15] [INFO ] Flow matrix only has 433 transitions (discarded 2980 similar events)
[2023-03-14 07:37:15] [INFO ] Invariant cache hit.
[2023-03-14 07:37:15] [INFO ] [Real]Absence check using 400 positive place invariants in 57 ms returned sat
[2023-03-14 07:37:15] [INFO ] After 186ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 833 stabilizing places and 3413 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 833 transition count 3413
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((p1&&(X(p3)||p2))))&&p0)))'
Support contains 9 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 804 transition count 3187
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 804 transition count 3187
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Iterating post reduction 0 with 222 rules applied. Total rules applied 280 place count 804 transition count 2965
Applied a total of 280 rules in 248 ms. Remains 804 /833 variables (removed 29) and now considering 2965/3413 (removed 448) transitions.
[2023-03-14 07:37:16] [INFO ] Flow matrix only has 404 transitions (discarded 2561 similar events)
// Phase 1: matrix 404 rows 804 cols
[2023-03-14 07:37:16] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-14 07:37:17] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
[2023-03-14 07:37:17] [INFO ] Flow matrix only has 404 transitions (discarded 2561 similar events)
[2023-03-14 07:37:17] [INFO ] Invariant cache hit.
[2023-03-14 07:37:17] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-14 07:37:17] [INFO ] Flow matrix only has 404 transitions (discarded 2561 similar events)
[2023-03-14 07:37:17] [INFO ] Invariant cache hit.
[2023-03-14 07:37:18] [INFO ] State equation strengthened by 396 read => feed constraints.
[2023-03-14 07:37:19] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-14 07:37:19] [INFO ] Flow matrix only has 404 transitions (discarded 2561 similar events)
[2023-03-14 07:37:19] [INFO ] Invariant cache hit.
[2023-03-14 07:37:20] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 804/833 places, 2965/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4993 ms. Remains : 804/833 places, 2965/3413 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s196 1) (GEQ s599 1) (GEQ s802 1)), p2:(OR (LT s201 1) (LT s582 1) (LT s802 1)), p1:(OR (LT s23 1) (LT s427 1) (LT s802 1)), p3:(OR (LT s298 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 251 steps with 1 reset in 13 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-00 finished in 5363 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)&&(G(p2)||p1))))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3170
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3170
Ensure Unique test removed 237 transitions
Reduce isomorphic transitions removed 237 transitions.
Iterating post reduction 0 with 237 rules applied. Total rules applied 299 place count 802 transition count 2933
Applied a total of 299 rules in 72 ms. Remains 802 /833 variables (removed 31) and now considering 2933/3413 (removed 480) transitions.
[2023-03-14 07:37:21] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:37:21] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-14 07:37:22] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
[2023-03-14 07:37:22] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:22] [INFO ] Invariant cache hit.
[2023-03-14 07:37:22] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-14 07:37:22] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:22] [INFO ] Invariant cache hit.
[2023-03-14 07:37:23] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:37:24] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned []
Implicit Place search using SMT with State Equation took 2702 ms to find 0 implicit places.
[2023-03-14 07:37:24] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:24] [INFO ] Invariant cache hit.
[2023-03-14 07:37:25] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/833 places, 2933/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4689 ms. Remains : 802/833 places, 2933/3413 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s323 1) (LT s703 1) (LT s800 1)), p2:(OR (LT s276 1) (LT s696 1) (LT s800 1)), p0:(OR (LT s276 1) (LT s696 1) (LT s800 1) (LT s276 1) (LT s696 ...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1089 ms.
Product exploration explored 100000 steps with 50000 reset in 1120 ms.
Computed a total of 802 stabilizing places and 2933 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 802 transition count 2933
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X p2)), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 10 factoid took 292 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-02 finished in 7949 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))'
Support contains 3 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 801 transition count 3161
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 801 transition count 3161
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Iterating post reduction 0 with 244 rules applied. Total rules applied 308 place count 801 transition count 2917
Applied a total of 308 rules in 66 ms. Remains 801 /833 variables (removed 32) and now considering 2917/3413 (removed 496) transitions.
[2023-03-14 07:37:29] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2023-03-14 07:37:29] [INFO ] Computed 400 place invariants in 9 ms
[2023-03-14 07:37:30] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
[2023-03-14 07:37:30] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:37:30] [INFO ] Invariant cache hit.
[2023-03-14 07:37:30] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-14 07:37:30] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:37:30] [INFO ] Invariant cache hit.
[2023-03-14 07:37:31] [INFO ] State equation strengthened by 393 read => feed constraints.
[2023-03-14 07:37:32] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
[2023-03-14 07:37:32] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:37:32] [INFO ] Invariant cache hit.
[2023-03-14 07:37:33] [INFO ] Dead Transitions using invariants and state equation in 1172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 801/833 places, 2917/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4824 ms. Remains : 801/833 places, 2917/3413 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s407 1) (GEQ s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-04 finished in 4928 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)&&X(G(p2)))))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3169
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3169
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 0 with 236 rules applied. Total rules applied 298 place count 802 transition count 2933
Applied a total of 298 rules in 81 ms. Remains 802 /833 variables (removed 31) and now considering 2933/3413 (removed 480) transitions.
[2023-03-14 07:37:34] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:37:34] [INFO ] Computed 400 place invariants in 11 ms
[2023-03-14 07:37:35] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
[2023-03-14 07:37:35] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:35] [INFO ] Invariant cache hit.
[2023-03-14 07:37:35] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-14 07:37:35] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:35] [INFO ] Invariant cache hit.
[2023-03-14 07:37:35] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:37:37] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2023-03-14 07:37:37] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:37] [INFO ] Invariant cache hit.
[2023-03-14 07:37:38] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/833 places, 2933/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4697 ms. Remains : 802/833 places, 2933/3413 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(OR (LT s183 1) (LT s622 1) (LT s800 1)), p0:(OR (LT s183 1) (LT s622 1) (LT s800 1) (LT s125 1) (LT s506 1) (LT s800 1)), p2:(AND (GEQ s125 1) (GEQ s5...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1032 ms.
Product exploration explored 100000 steps with 50000 reset in 1106 ms.
Computed a total of 802 stabilizing places and 2933 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 802 transition count 2933
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 12 factoid took 197 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-05 finished in 7878 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(p0)&&X(G(p1))))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3169
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3169
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 0 with 236 rules applied. Total rules applied 298 place count 802 transition count 2933
Applied a total of 298 rules in 85 ms. Remains 802 /833 variables (removed 31) and now considering 2933/3413 (removed 480) transitions.
[2023-03-14 07:37:42] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:37:42] [INFO ] Computed 400 place invariants in 13 ms
[2023-03-14 07:37:43] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
[2023-03-14 07:37:43] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:43] [INFO ] Invariant cache hit.
[2023-03-14 07:37:43] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-14 07:37:43] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:43] [INFO ] Invariant cache hit.
[2023-03-14 07:37:43] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:37:45] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2023-03-14 07:37:45] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:37:45] [INFO ] Invariant cache hit.
[2023-03-14 07:37:46] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/833 places, 2933/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4809 ms. Remains : 802/833 places, 2933/3413 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s360 1) (LT s758 1) (LT s800 1)), p0:(AND (GEQ s119 1) (GEQ s520 1) (GEQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 2 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-06 finished in 4938 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(p0))'
Support contains 3 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 801 transition count 3158
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 801 transition count 3158
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Iterating post reduction 0 with 247 rules applied. Total rules applied 311 place count 801 transition count 2911
Applied a total of 311 rules in 744 ms. Remains 801 /833 variables (removed 32) and now considering 2911/3413 (removed 502) transitions.
[2023-03-14 07:37:47] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
// Phase 1: matrix 401 rows 801 cols
[2023-03-14 07:37:47] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-14 07:37:48] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
[2023-03-14 07:37:48] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
[2023-03-14 07:37:48] [INFO ] Invariant cache hit.
[2023-03-14 07:37:49] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-14 07:37:49] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
[2023-03-14 07:37:49] [INFO ] Invariant cache hit.
[2023-03-14 07:37:49] [INFO ] State equation strengthened by 393 read => feed constraints.
[2023-03-14 07:37:51] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2023-03-14 07:37:51] [INFO ] Redundant transitions in 206 ms returned []
[2023-03-14 07:37:51] [INFO ] Flow matrix only has 401 transitions (discarded 2510 similar events)
[2023-03-14 07:37:51] [INFO ] Invariant cache hit.
[2023-03-14 07:37:52] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/833 places, 2911/3413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5619 ms. Remains : 801/833 places, 2911/3413 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s190 1) (GEQ s631 1) (GEQ s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 355 steps with 1 reset in 10 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-07 finished in 5680 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' '!((!p0 U (G((!p0||G(!p1)))||((!p0||G(!p1))&&G(!p2)))))'
Support contains 7 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 803 transition count 3180
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 803 transition count 3180
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Iterating post reduction 0 with 229 rules applied. Total rules applied 289 place count 803 transition count 2951
Applied a total of 289 rules in 721 ms. Remains 803 /833 variables (removed 30) and now considering 2951/3413 (removed 462) transitions.
[2023-03-14 07:37:53] [INFO ] Flow matrix only has 403 transitions (discarded 2548 similar events)
// Phase 1: matrix 403 rows 803 cols
[2023-03-14 07:37:53] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-14 07:37:54] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
[2023-03-14 07:37:54] [INFO ] Flow matrix only has 403 transitions (discarded 2548 similar events)
[2023-03-14 07:37:54] [INFO ] Invariant cache hit.
[2023-03-14 07:37:54] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-14 07:37:54] [INFO ] Flow matrix only has 403 transitions (discarded 2548 similar events)
[2023-03-14 07:37:54] [INFO ] Invariant cache hit.
[2023-03-14 07:37:55] [INFO ] State equation strengthened by 395 read => feed constraints.
[2023-03-14 07:37:56] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2023-03-14 07:37:57] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-14 07:37:57] [INFO ] Flow matrix only has 403 transitions (discarded 2548 similar events)
[2023-03-14 07:37:57] [INFO ] Invariant cache hit.
[2023-03-14 07:37:58] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/833 places, 2951/3413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5525 ms. Remains : 803/833 places, 2951/3413 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (AND p0 p1), (AND p2 p1), (AND p1 p0 p2), p1, p2]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s169 1) (GEQ s589 1) (GEQ s801 1)), p1:(AND (GEQ s301 1) (GEQ s722 1) (GEQ s801 1)), p2:(AND (GEQ s167 1) (GEQ s588 1) (GEQ s801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 472 reset in 2206 ms.
Product exploration explored 100000 steps with 484 reset in 2320 ms.
Computed a total of 803 stabilizing places and 2951 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 803 transition count 2951
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 1057 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[true, p1, (AND p0 p1), p2, (AND p1 p2), (AND p1 p0 p2)]
Finished random walk after 5043 steps, including 21 resets, run visited all 14 properties in 177 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2)), (F (AND p1 (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (AND (NOT p1) p2 p0)), (F (AND p1 p2 p0))]
Property proved to be false thanks to negative knowledge :(F (AND p1 p2 p0))
Knowledge based reduction with 28 factoid took 617 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-09 finished in 12876 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(F(p0))||G(p1))))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3167
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3167
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 302 place count 802 transition count 2927
Applied a total of 302 rules in 628 ms. Remains 802 /833 variables (removed 31) and now considering 2927/3413 (removed 486) transitions.
[2023-03-14 07:38:06] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:38:06] [INFO ] Computed 400 place invariants in 13 ms
[2023-03-14 07:38:06] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
[2023-03-14 07:38:06] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
[2023-03-14 07:38:06] [INFO ] Invariant cache hit.
[2023-03-14 07:38:07] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-14 07:38:07] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
[2023-03-14 07:38:07] [INFO ] Invariant cache hit.
[2023-03-14 07:38:07] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:38:09] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
[2023-03-14 07:38:09] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-14 07:38:09] [INFO ] Flow matrix only has 402 transitions (discarded 2525 similar events)
[2023-03-14 07:38:09] [INFO ] Invariant cache hit.
[2023-03-14 07:38:10] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/833 places, 2927/3413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5317 ms. Remains : 802/833 places, 2927/3413 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s134 1) (GEQ s515 1) (GEQ s800 1)), p0:(OR (LT s208 1) (LT s649 1) (LT s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 482 reset in 2132 ms.
Product exploration explored 100000 steps with 500 reset in 2336 ms.
Computed a total of 802 stabilizing places and 2927 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 802 transition count 2927
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-10 finished in 10560 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((F(G(p1))&&p0))))'
Support contains 7 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 803 transition count 3175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 803 transition count 3175
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 0 with 232 rules applied. Total rules applied 292 place count 803 transition count 2943
Applied a total of 292 rules in 77 ms. Remains 803 /833 variables (removed 30) and now considering 2943/3413 (removed 470) transitions.
[2023-03-14 07:38:16] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
// Phase 1: matrix 403 rows 803 cols
[2023-03-14 07:38:16] [INFO ] Computed 400 place invariants in 8 ms
[2023-03-14 07:38:17] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
[2023-03-14 07:38:17] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:17] [INFO ] Invariant cache hit.
[2023-03-14 07:38:17] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-14 07:38:17] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:17] [INFO ] Invariant cache hit.
[2023-03-14 07:38:17] [INFO ] State equation strengthened by 395 read => feed constraints.
[2023-03-14 07:38:19] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2567 ms to find 0 implicit places.
[2023-03-14 07:38:19] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:19] [INFO ] Invariant cache hit.
[2023-03-14 07:38:20] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 803/833 places, 2943/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4552 ms. Remains : 803/833 places, 2943/3413 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s414 1) (LT s801 1)) (OR (LT s291 1) (LT s711 1) (LT s801 1))), p1:(OR (LT s303 1) (LT s723 1) (LT s801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2739 steps with 9 reset in 64 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-11 finished in 4771 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||X(p0)) U p1)))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3167
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3167
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 0 with 236 rules applied. Total rules applied 298 place count 802 transition count 2931
Applied a total of 298 rules in 78 ms. Remains 802 /833 variables (removed 31) and now considering 2931/3413 (removed 482) transitions.
[2023-03-14 07:38:20] [INFO ] Flow matrix only has 402 transitions (discarded 2529 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:38:20] [INFO ] Computed 400 place invariants in 12 ms
[2023-03-14 07:38:21] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
[2023-03-14 07:38:21] [INFO ] Flow matrix only has 402 transitions (discarded 2529 similar events)
[2023-03-14 07:38:21] [INFO ] Invariant cache hit.
[2023-03-14 07:38:22] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-14 07:38:22] [INFO ] Flow matrix only has 402 transitions (discarded 2529 similar events)
[2023-03-14 07:38:22] [INFO ] Invariant cache hit.
[2023-03-14 07:38:22] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:38:24] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2023-03-14 07:38:24] [INFO ] Flow matrix only has 402 transitions (discarded 2529 similar events)
[2023-03-14 07:38:24] [INFO ] Invariant cache hit.
[2023-03-14 07:38:25] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/833 places, 2931/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4696 ms. Remains : 802/833 places, 2931/3413 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s22 1) (GEQ s401 1) (GEQ s800 1))) (AND (GEQ s159 1) (GEQ s538 1) (GEQ s800 1))), p0:(AND (GEQ s159 1) (GEQ s538 1) (GEQ s800 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1395 steps with 8 reset in 37 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-12 finished in 4881 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)))'
Support contains 3 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 801 transition count 3161
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 801 transition count 3161
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Iterating post reduction 0 with 244 rules applied. Total rules applied 308 place count 801 transition count 2917
Applied a total of 308 rules in 596 ms. Remains 801 /833 variables (removed 32) and now considering 2917/3413 (removed 496) transitions.
[2023-03-14 07:38:26] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
// Phase 1: matrix 401 rows 801 cols
[2023-03-14 07:38:26] [INFO ] Computed 400 place invariants in 8 ms
[2023-03-14 07:38:27] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
[2023-03-14 07:38:27] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:38:27] [INFO ] Invariant cache hit.
[2023-03-14 07:38:27] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-14 07:38:27] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:38:27] [INFO ] Invariant cache hit.
[2023-03-14 07:38:28] [INFO ] State equation strengthened by 393 read => feed constraints.
[2023-03-14 07:38:29] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
[2023-03-14 07:38:29] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-14 07:38:29] [INFO ] Flow matrix only has 401 transitions (discarded 2516 similar events)
[2023-03-14 07:38:29] [INFO ] Invariant cache hit.
[2023-03-14 07:38:30] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/833 places, 2917/3413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5249 ms. Remains : 801/833 places, 2917/3413 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s520 1) (GEQ s799 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 9 ms.
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-13 finished in 5346 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((G(p0)||X(F(p1))))))'
Support contains 5 out of 833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 802 transition count 3169
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 802 transition count 3169
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 0 with 236 rules applied. Total rules applied 298 place count 802 transition count 2933
Applied a total of 298 rules in 85 ms. Remains 802 /833 variables (removed 31) and now considering 2933/3413 (removed 480) transitions.
[2023-03-14 07:38:31] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
// Phase 1: matrix 402 rows 802 cols
[2023-03-14 07:38:31] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-14 07:38:32] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
[2023-03-14 07:38:32] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:38:32] [INFO ] Invariant cache hit.
[2023-03-14 07:38:32] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-14 07:38:32] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:38:32] [INFO ] Invariant cache hit.
[2023-03-14 07:38:32] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-14 07:38:34] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2023-03-14 07:38:34] [INFO ] Flow matrix only has 402 transitions (discarded 2531 similar events)
[2023-03-14 07:38:34] [INFO ] Invariant cache hit.
[2023-03-14 07:38:35] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 802/833 places, 2933/3413 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4692 ms. Remains : 802/833 places, 2933/3413 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s283 1) (GEQ s662 1) (GEQ s800 1)), p1:(OR (LT s253 1) (LT s674 1) (LT s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 849 ms.
Product exploration explored 100000 steps with 33333 reset in 992 ms.
Computed a total of 802 stabilizing places and 2933 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 802 transition count 2933
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-14 finished in 7373 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||X(F(p1)))&&(X(F(p1))||G(p2))))))'
Support contains 7 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 3413/3413 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 803 transition count 3174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 803 transition count 3174
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Iterating post reduction 0 with 231 rules applied. Total rules applied 291 place count 803 transition count 2943
Applied a total of 291 rules in 599 ms. Remains 803 /833 variables (removed 30) and now considering 2943/3413 (removed 470) transitions.
[2023-03-14 07:38:38] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
// Phase 1: matrix 403 rows 803 cols
[2023-03-14 07:38:38] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-14 07:38:39] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
[2023-03-14 07:38:39] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:39] [INFO ] Invariant cache hit.
[2023-03-14 07:38:40] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-14 07:38:40] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:40] [INFO ] Invariant cache hit.
[2023-03-14 07:38:40] [INFO ] State equation strengthened by 395 read => feed constraints.
[2023-03-14 07:38:42] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2618 ms to find 0 implicit places.
[2023-03-14 07:38:42] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-14 07:38:42] [INFO ] Flow matrix only has 403 transitions (discarded 2540 similar events)
[2023-03-14 07:38:42] [INFO ] Invariant cache hit.
[2023-03-14 07:38:43] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/833 places, 2943/3413 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5191 ms. Remains : 803/833 places, 2943/3413 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhaseVariation-PT-D20CS100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s202 1) (GEQ s602 1) (GEQ s801 1)), p2:(AND (GEQ s128 1) (GEQ s548 1) (GEQ s801 1)), p1:(OR (LT s74 1) (LT s455 1) (LT s801 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33309 reset in 891 ms.
Product exploration explored 100000 steps with 33151 reset in 1034 ms.
Computed a total of 803 stabilizing places and 2943 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 803 transition count 2943
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 342 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D20CS100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D20CS100-LTLFireability-15 finished in 8111 ms.
All properties solved by simple procedures.
Total runtime 103104 ms.
ITS solved all properties within timeout

BK_STOP 1678779527770

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="PhaseVariation-PT-D20CS100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PhaseVariation-PT-D20CS100, 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 r295-tall-167873947400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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