Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151500297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DiscoveryGPU-PT-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:42 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 DiscoveryGPU-PT-13a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421427017

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:43:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:43:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:43:48] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-22 23:43:48] [INFO ] Transformed 133 places.
[2024-05-22 23:43:48] [INFO ] Transformed 183 transitions.
[2024-05-22 23:43:48] [INFO ] Found NUPN structural information;
[2024-05-22 23:43:48] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 125 transition count 175
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 125 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 117 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 117 transition count 167
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 110 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 110 transition count 153
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 110 transition count 147
Applied a total of 52 rules in 36 ms. Remains 110 /133 variables (removed 23) and now considering 147/183 (removed 36) transitions.
// Phase 1: matrix 147 rows 110 cols
[2024-05-22 23:43:49] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 23:43:49] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 23:43:49] [INFO ] Invariant cache hit.
[2024-05-22 23:43:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-22 23:43:49] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 541 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 147/183 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 584 ms. Remains : 109/133 places, 147/183 transitions.
Support contains 22 out of 109 places after structural reductions.
[2024-05-22 23:43:49] [INFO ] Flatten gal took : 33 ms
[2024-05-22 23:43:49] [INFO ] Flatten gal took : 20 ms
[2024-05-22 23:43:49] [INFO ] Input system was already deterministic with 147 transitions.
Finished random walk after 869 steps, including 5 resets, run visited all 17 properties in 63 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 283 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 13 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-22 23:43:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:43:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 23:43:50] [INFO ] Invariant cache hit.
[2024-05-22 23:43:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 23:43:50] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-22 23:43:50] [INFO ] Invariant cache hit.
[2024-05-22 23:43:50] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 96/109 places, 134/147 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-00 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 (EQ s77 0) (EQ s4 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 DiscoveryGPU-PT-13a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-00 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X((p1||X(p2)))||G(p3))))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 102 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 102 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 99 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 99 transition count 137
Applied a total of 20 rules in 17 ms. Remains 99 /109 variables (removed 10) and now considering 137/147 (removed 10) transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-22 23:43:50] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 23:43:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:43:50] [INFO ] Invariant cache hit.
[2024-05-22 23:43:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 23:43:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-22 23:43:50] [INFO ] Invariant cache hit.
[2024-05-22 23:43:50] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 137/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 99/109 places, 137/147 transitions.
Stuttering acceptance computed with spot in 565 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p3), acceptance={} source=10 dest: 6}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 6}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) p3), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={} source=12 dest: 11}, { cond=(AND p0 p3), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(EQ s25 1), p3:(EQ s69 1), p1:(EQ s25 0), p2:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33246 reset in 417 ms.
Product exploration explored 100000 steps with 33252 reset in 251 ms.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/99 stabilizing places and 14/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p1), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
Knowledge based reduction with 16 factoid took 514 ms. Reduced automaton from 13 states, 32 edges and 4 AP (stutter sensitive) to 13 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 581 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 23:43:53] [INFO ] Invariant cache hit.
[2024-05-22 23:43:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 23:43:53] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-22 23:43:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-22 23:43:53] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p1), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p3)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (F (NOT p1)), (F (AND p0 p3)), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p3))), (F p0), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p0 (NOT p3))), (F (AND (NOT p0) p3)), (F p3), (F (AND p0 p3 (NOT p2))), (F (AND p0 (NOT p3) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p3 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) p3 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p3)))]
Knowledge based reduction with 19 factoid took 1337 ms. Reduced automaton from 13 states, 32 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 649 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 23:43:56] [INFO ] Invariant cache hit.
[2024-05-22 23:43:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:43:56] [INFO ] Invariant cache hit.
[2024-05-22 23:43:56] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 23:43:56] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-22 23:43:56] [INFO ] Invariant cache hit.
[2024-05-22 23:43:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 99/99 places, 137/137 transitions.
Computed a total of 15 stabilizing places and 14 stable transitions
Graph (complete) has 270 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 14 stable transitions
Detected a total of 15/99 stabilizing places and 14/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 430 ms. Reduced automaton from 13 states, 29 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 18) seen :15
Finished Best-First random walk after 3149 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=629 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (AND p3 (NOT p2))), (F (NOT p1)), (F (AND p3 p0 (NOT p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (AND p3 p0)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p3)), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND (NOT p1) (NOT p3))), (F (NOT (AND (NOT p3) (NOT p0)))), (F p0), (F (AND (NOT p3) p0)), (F p3), (F (AND p3 (NOT p0))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 1025 ms. Reduced automaton from 13 states, 29 edges and 4 AP (stutter sensitive) to 13 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 495 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 498 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 490 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 33322 reset in 180 ms.
Product exploration explored 100000 steps with 33417 reset in 289 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 137/137 transitions.
Graph (complete) has 270 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 98 transition count 136
Deduced a syphon composed of 2 places in 8 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 136
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 29 place count 98 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 87 transition count 140
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 87 transition count 140
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 72 place count 66 transition count 98
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 93 place count 66 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 103 place count 56 transition count 88
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 113 place count 56 transition count 88
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 123 place count 46 transition count 68
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 133 place count 46 transition count 68
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 152 place count 27 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 171 place count 27 transition count 39
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 171 rules in 47 ms. Remains 27 /99 variables (removed 72) and now considering 39/137 (removed 98) transitions.
[2024-05-22 23:44:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:44:01] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 27 cols
[2024-05-22 23:44:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:44:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/99 places, 39/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 27/99 places, 39/137 transitions.
Built C files in :
/tmp/ltsmin5872871908025940454
[2024-05-22 23:44:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5872871908025940454
Running compilation step : cd /tmp/ltsmin5872871908025940454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin5872871908025940454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5872871908025940454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7119832858622033320.hoa' '--buchi-type=spotba'
LTSmin run took 14293 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-01 finished in 25900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(p1)&&p0))&&(G(p2)||F(p3)))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 102 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 102 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 99 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 99 transition count 137
Applied a total of 20 rules in 12 ms. Remains 99 /109 variables (removed 10) and now considering 137/147 (removed 10) transitions.
// Phase 1: matrix 137 rows 99 cols
[2024-05-22 23:44:16] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 23:44:16] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-22 23:44:16] [INFO ] Invariant cache hit.
[2024-05-22 23:44:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 23:44:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-22 23:44:16] [INFO ] Invariant cache hit.
[2024-05-22 23:44:16] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 137/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 99/109 places, 137/147 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s17 0) (EQ s13 1)), p2:(EQ s56 1), p3:(OR (EQ s63 0) (EQ s81 1)), p1:(EQ s56 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 232 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-02 finished in 885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 7 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-22 23:44:17] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 23:44:17] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 23:44:17] [INFO ] Invariant cache hit.
[2024-05-22 23:44:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 23:44:17] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-22 23:44:17] [INFO ] Invariant cache hit.
[2024-05-22 23:44:17] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 96/109 places, 134/147 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-05 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 s16 0) (EQ s15 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 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-05 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(p0) U p1)))&&X(F(p2))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 101 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 101 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 97 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 97 transition count 135
Applied a total of 24 rules in 9 ms. Remains 97 /109 variables (removed 12) and now considering 135/147 (removed 12) transitions.
// Phase 1: matrix 135 rows 97 cols
[2024-05-22 23:44:17] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:44:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 23:44:17] [INFO ] Invariant cache hit.
[2024-05-22 23:44:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 23:44:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-22 23:44:17] [INFO ] Invariant cache hit.
[2024-05-22 23:44:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 135/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 97/109 places, 135/147 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s33 0) (EQ s45 1)), p1:(OR (EQ s71 0) (EQ s59 1)), p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 730 reset in 178 ms.
Stack based approach found an accepted trace after 1614 steps with 12 reset with depth 93 and stack size 56 in 11 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-06 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 100 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 96 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 134
Applied a total of 26 rules in 3 ms. Remains 96 /109 variables (removed 13) and now considering 134/147 (removed 13) transitions.
// Phase 1: matrix 134 rows 96 cols
[2024-05-22 23:44:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:18] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 134/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 96/109 places, 134/147 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-09 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s58 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-09 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Graph (complete) has 283 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 123 edges and 102 vertex of which 91 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 101 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 55 place count 53 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 41 transition count 68
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 41 transition count 68
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 29 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 29 transition count 44
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 114 place count 18 transition count 22
Iterating global reduction 2 with 11 rules applied. Total rules applied 125 place count 18 transition count 22
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 136 place count 7 transition count 11
Iterating global reduction 2 with 11 rules applied. Total rules applied 147 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 6 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 6 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 5 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 5 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 4 transition count 7
Applied a total of 155 rules in 23 ms. Remains 4 /109 variables (removed 105) and now considering 7/147 (removed 140) transitions.
[2024-05-22 23:44:18] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-22 23:44:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:44:18] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 23:44:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:44:18] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/109 places, 7/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 4/109 places, 7/147 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, 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 DiscoveryGPU-PT-13a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-12 finished in 165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 147/147 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 105 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 103 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 103 transition count 141
Applied a total of 12 rules in 8 ms. Remains 103 /109 variables (removed 6) and now considering 141/147 (removed 6) transitions.
// Phase 1: matrix 141 rows 103 cols
[2024-05-22 23:44:18] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 23:44:18] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-22 23:44:18] [INFO ] Invariant cache hit.
[2024-05-22 23:44:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 141/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 103/109 places, 141/147 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s80 1)), p1:(AND (NEQ s42 0) (NEQ s22 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]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLCardinality-14 finished in 408 ms.
All properties solved by simple procedures.
Total runtime 30739 ms.

BK_STOP 1716421460202

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="DiscoveryGPU-PT-13a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-13a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;