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-171631151400247.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-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 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 28K 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-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421010790

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-08a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:36:52] [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:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:36:52] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-22 23:36:52] [INFO ] Transformed 83 places.
[2024-05-22 23:36:52] [INFO ] Transformed 113 transitions.
[2024-05-22 23:36:52] [INFO ] Found NUPN structural information;
[2024-05-22 23:36:52] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 109
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 79 transition count 101
Applied a total of 16 rules in 26 ms. Remains 79 /83 variables (removed 4) and now considering 101/113 (removed 12) transitions.
// Phase 1: matrix 101 rows 79 cols
[2024-05-22 23:36:52] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 23:36:52] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-22 23:36:52] [INFO ] Invariant cache hit.
[2024-05-22 23:36:52] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:36:52] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-22 23:36:53] [INFO ] Invariant cache hit.
[2024-05-22 23:36:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/83 places, 101/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 79/83 places, 101/113 transitions.
Support contains 34 out of 79 places after structural reductions.
[2024-05-22 23:36:53] [INFO ] Flatten gal took : 22 ms
[2024-05-22 23:36:53] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:36:53] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 23:36:53] [INFO ] Invariant cache hit.
[2024-05-22 23:36:53] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 23:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-22 23:36:53] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 15 ms. Remains 62 /79 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:36:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:36:54] [INFO ] Invariant cache hit.
[2024-05-22 23:36:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/79 places, 84/101 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 45 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 39 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 39 transition count 56
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 33 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 33 transition count 44
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 27 transition count 38
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 27 transition count 38
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 21 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 21 transition count 26
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 16 transition count 21
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 16 transition count 21
Applied a total of 90 rules in 11 ms. Remains 16 /61 variables (removed 45) and now considering 21/84 (removed 63) transitions.
[2024-05-22 23:36:54] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2024-05-22 23:36:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 23:36:54] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-22 23:36:54] [INFO ] Invariant cache hit.
[2024-05-22 23:36:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/79 places, 21/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 16/79 places, 21/101 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 273 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-01 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:(OR (EQ s7 0) (EQ s8 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 2 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-01 finished in 550 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(p0)||X((G(p1)||(p1&&F(p2))))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 69 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 69 transition count 91
Applied a total of 20 rules in 10 ms. Remains 69 /79 variables (removed 10) and now considering 91/101 (removed 10) transitions.
// Phase 1: matrix 91 rows 69 cols
[2024-05-22 23:36:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:36:54] [INFO ] Invariant cache hit.
[2024-05-22 23:36:54] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-22 23:36:54] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 91/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 68/79 places, 91/101 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=2, aps=[p2:(OR (EQ s58 0) (EQ s31 1)), p0:(AND (EQ s11 0) (EQ s55 1)), p1:(OR (EQ s2 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 176 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-02 finished in 1038 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((X(X(p1))||p0))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 68 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 65 transition count 87
Applied a total of 28 rules in 9 ms. Remains 65 /79 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 65 cols
[2024-05-22 23:36:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:36:55] [INFO ] Invariant cache hit.
[2024-05-22 23:36:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:55] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/79 places, 87/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 64/79 places, 87/101 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s38 1) (EQ s30 0) (EQ s16 1)), p1:(AND (EQ s26 0) (EQ s58 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 135 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 344 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(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 67 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 64 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 64 transition count 86
Applied a total of 30 rules in 9 ms. Remains 64 /79 variables (removed 15) and now considering 86/101 (removed 15) transitions.
// Phase 1: matrix 86 rows 64 cols
[2024-05-22 23:36:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 23:36:55] [INFO ] Invariant cache hit.
[2024-05-22 23:36:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/79 places, 86/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 63/79 places, 86/101 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 169 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-05 finished in 535 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(p0) U G(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 73 vertex of which 60 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (trivial) has 63 edges and 60 vertex of which 30 / 60 are part of one of the 15 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 45 transition count 75
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 38 place count 36 transition count 60
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 31 transition count 50
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 31 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 27 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 27 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 23 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 23 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 19 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 19 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 16 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 16 transition count 26
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 12 transition count 22
Applied a total of 83 rules in 11 ms. Remains 12 /79 variables (removed 67) and now considering 22/101 (removed 79) transitions.
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-05-22 23:36:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 23:36:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/79 places, 22/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 12/79 places, 22/101 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 1), p0:(OR (EQ s5 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 206 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((p0&&F((p0&&G(p1)))))||G((p2 U p3))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 59 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (trivial) has 60 edges and 59 vertex of which 30 / 59 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 44 transition count 76
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 37 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 32 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 32 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 27 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 27 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 24 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 24 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 21 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 21 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 19 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 72 place count 18 transition count 31
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 18 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 17 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 13 transition count 23
Applied a total of 82 rules in 14 ms. Remains 13 /79 variables (removed 66) and now considering 23/101 (removed 78) transitions.
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 13 cols
[2024-05-22 23:36:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 23:36:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:36:56] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 23/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 13/79 places, 23/101 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(OR p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=6 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=8 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s6 0), p3:(OR (EQ s12 0) (EQ s2 1)), p2:(OR (EQ s2 0) (EQ s8 1)), p1:(AND (EQ s2 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-12 finished in 454 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' '!((!p0 U X(G(p1))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 67 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 65 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 65 transition count 87
Applied a total of 28 rules in 4 ms. Remains 65 /79 variables (removed 14) and now considering 87/101 (removed 14) transitions.
// Phase 1: matrix 87 rows 65 cols
[2024-05-22 23:36:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 23:36:57] [INFO ] Invariant cache hit.
[2024-05-22 23:36:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-22 23:36:57] [INFO ] Invariant cache hit.
[2024-05-22 23:36:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/79 places, 87/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 65/79 places, 87/101 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s64 1), p0:(OR (AND (EQ s34 1) (EQ s64 1)) (EQ s5 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1156 reset in 177 ms.
Product exploration explored 100000 steps with 1161 reset in 176 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:36:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-22 23:36:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:58] [INFO ] [Real]Added 58 Read/Feed constraints in 6 ms returned sat
[2024-05-22 23:36:58] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 23:36:58] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 65/65 places, 87/87 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:36:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:36:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-22 23:36:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:36:59] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2024-05-22 23:36:59] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 23:36:59] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1161 reset in 118 ms.
Product exploration explored 100000 steps with 1162 reset in 125 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 63 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 7 ms. Remains 61 /65 variables (removed 4) and now considering 83/87 (removed 4) transitions.
[2024-05-22 23:36:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 83 rows 61 cols
[2024-05-22 23:36:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:59] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/65 places, 83/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 61/65 places, 83/87 transitions.
Built C files in :
/tmp/ltsmin17650105306190191351
[2024-05-22 23:36:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17650105306190191351
Running compilation step : cd /tmp/ltsmin17650105306190191351;'/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 248 ms.
Running link step : cd /tmp/ltsmin17650105306190191351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17650105306190191351;'/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/stateBased14597221273870407605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 62 transition count 84
Applied a total of 6 rules in 5 ms. Remains 62 /65 variables (removed 3) and now considering 84/87 (removed 3) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:37:15] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:37:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 23:37:15] [INFO ] Invariant cache hit.
[2024-05-22 23:37:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:37:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 23:37:15] [INFO ] Invariant cache hit.
[2024-05-22 23:37:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 62/65 places, 84/87 transitions.
Built C files in :
/tmp/ltsmin5602484479038881405
[2024-05-22 23:37:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5602484479038881405
Running compilation step : cd /tmp/ltsmin5602484479038881405;'/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 147 ms.
Running link step : cd /tmp/ltsmin5602484479038881405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5602484479038881405;'/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/stateBased3222789489865379799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:37:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:37:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:37:30] [INFO ] Time to serialize gal into /tmp/LTL10765734014638855583.gal : 2 ms
[2024-05-22 23:37:30] [INFO ] Time to serialize properties into /tmp/LTL14628118874207299572.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10765734014638855583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3791089195918408549.hoa' '-atoms' '/tmp/LTL14628118874207299572.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14628118874207299572.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3791089195918408549.hoa
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t30, t32, t34, t35, t37, t39, t89, t90, t92, t93, t95, t96, t97, t98, t100, Inters...246
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
323 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.25383,113288,1,0,267,515869,191,260,1916,642720,553
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 37187 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 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Graph (complete) has 224 edges and 79 vertex of which 75 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 7 ms. Remains 62 /79 variables (removed 17) and now considering 84/101 (removed 17) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:37:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:37:34] [INFO ] Invariant cache hit.
[2024-05-22 23:37:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/79 places, 84/101 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 46 transition count 69
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 40 transition count 57
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 40 transition count 57
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 34 transition count 45
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 34 transition count 45
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 29 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 29 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 24 transition count 30
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 24 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 20 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 20 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 20 transition count 26
Applied a total of 83 rules in 8 ms. Remains 20 /61 variables (removed 41) and now considering 26/84 (removed 58) transitions.
[2024-05-22 23:37:34] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 20 cols
[2024-05-22 23:37:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:37:34] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2024-05-22 23:37:34] [INFO ] Invariant cache hit.
[2024-05-22 23:37:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/79 places, 26/101 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 20/79 places, 26/101 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s18 1) (EQ s4 0) (EQ s8 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 109 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-14 finished in 273 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(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 66 transition count 88
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 66 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 63 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 63 transition count 85
Applied a total of 32 rules in 2 ms. Remains 63 /79 variables (removed 16) and now considering 85/101 (removed 16) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 23:37:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:37:34] [INFO ] Invariant cache hit.
[2024-05-22 23:37:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:37:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/79 places, 85/101 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 62/79 places, 85/101 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-15 finished in 460 ms.
All properties solved by simple procedures.
Total runtime 42621 ms.

BK_STOP 1716421056139

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

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